Results 1 to 10 of about 60,575 (138)
Parallel communicating grammar systems with bounded resources
Theoretical Computer Science, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erzsébet Csuhaj-Varjú, György Vaszil
openaire +4 more sources
On the number of components for some parallel communicating grammar systems
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jürgen Dassow, Bianca Truthe
openaire +4 more sources
On the computational completeness of context-free parallel communicating grammar systems
Theoretical Computer Science, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erzsébet Csuhaj-Varjú, György Vaszil
openaire +3 more sources
Some decision problems for parallel communicating grammar systems
Theoretical Computer Science, 1994 AbstractIn this paper we investigate several decision problems for parallel communicating grammar systems: the enabling, circularity, centralizing, conflict-freeness, boundedness, membership, equivalence, inclusion, emptiness and finiteness problems.
Ferucio Laurentiu Tiplea +3 more
openaire +3 more sources
Theoretical Computer Science, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erzsébet Csuhaj-Varjú, György Vaszil
openaire +3 more sources
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dana Pardubská +2 more
openaire +4 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
On the Size Complexity of Non-Returning Context-Free PC Grammar Systems [PDF]
, 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 +3 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