Results 1 to 10 of about 64,804 (90)
On the Size Complexity of Non-Returning Context-Free PC Grammar Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Improving the previously known best bound, we show that any recursively enumerable language can be generated with a non-returning parallel communicating (PC) grammar system having six context-free components.
Bianca Truthe +15 more
core +5 more sources
Parallel Communicating String - Graph P System [PDF]
, 2021 The concept of parallel communicating grammar systems generating string languages is extended to string-graph P systems and their generative power is studied.
David, N.G., Sankar, Meena Parvathy
core +2 more sources
Enabling security checking of automotive ECUs with formal CSP models [PDF]
, 2019 This paper presents an approach, using the process-algebra CSP, that aims to support systematic security testing of ECU components. An example use case regarding Over-The-Air software updates demonstrates the potential of our approach.
Bryans, Jeremy +4 more
core +1 more source
Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Process Calculi [PDF]
, 2010 Labeled transition systems are typically used to represent the behavior of nondeterministic processes, with labeled transitions defining a one-step state to-state reachability relation.
Bernardo, Marco +2 more
core +3 more sources
Unlocking Blocked Communicating Processes
, 2015 We study the problem of disentangling locked processes via code refactoring. We identify and characterise a class of processes that is not lock-free; then we formalise an algorithm that statically detects potential locks and propose refactoring ...
Francalanza, Adrian +2 more
core +4 more sources
On the power of parallel communicating grammar systems with right-linear components [PDF]
RAIRO - Theoretical Informatics and Applications, 1997 Summary: We settle here two problems concerning the generative power of parallel communicating grammar systems with right-linear components: (1) each linear language can be generated by a non-centralized returning system, (2) the family of languages generated by centralized returning systems is incomparable with the family of languages generated by non-
Sorina Dumitrescu, Gheorghe Paun
openaire +2 more sources
Poetic Judgement in Everyday Speech
PhilosophiesSpeaking is a highly conventional enterprise. But unusual usages are, nonetheless, frequently encountered. Some of these novelties fall flat, while others find favour, to the extent of entering common usage.
Paul Magee
doaj +1 more source
Serializing the Parallelism in Parallel Communicating Pushdown Automata Systems
, 2009 We consider parallel communicating pushdown automata systems (PCPA) and define a property called known communication for it. We use this property to prove that the power of a variant of PCPA, called returning centralized parallel communicating pushdown ...
Bianca Truthe +14 more
core +2 more sources
SCOOP: A Tool for SymboliC Optimisations Of Probabilistic Processes [PDF]
, 2011 This paper presents SCOOP: a tool that symbolically optimises process-algebraic specifications of probabilistic processes. It takes specifications in the prCRL language (combining data and probabilities), which are linearised first to an intermediate ...
Timmer, Mark
core +2 more sources
Open Transactions on Shared Memory [PDF]
, 2015 Transactional memory has arisen as a good way for solving many of the issues of lock-based programming. However, most implementations admit isolated transactions only, which are not adequate when we have to coordinate communicating processes. To this end,
A. Mansutti +12 more
core +3 more sources