Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
36
0

Year Published

2006
2006
2018
2018

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 52 publications
(37 citation statements)
references
References 11 publications
1
36
0
Order By: Relevance
“…Hence, both the universal and existential termination properties turn out to be undecidable in MBD with the maximal parallelism semantics. From the decidability of universal termination in MBD with interleaving semantics (3), we obtain an expressiveness gap between MBD with the interleaving and with the maximal parallelism semantics, thus confirming the intuition emerging from [9] for P systems: in most cases the computational power increases when moving from interleaving to maximal parallelism. Note that the undecidability of universal termination for MBD with maximal parallelism semantics does not contradict the decidability of universal termination for MBD with interleaving semantics provided in the present paper, as the well-quasi-ordering on systems sys defined in Section 4 is not compatible with the maximal parallelism reduction semantics.…”
Section: Resultssupporting
confidence: 61%
See 1 more Smart Citation
“…Hence, both the universal and existential termination properties turn out to be undecidable in MBD with the maximal parallelism semantics. From the decidability of universal termination in MBD with interleaving semantics (3), we obtain an expressiveness gap between MBD with the interleaving and with the maximal parallelism semantics, thus confirming the intuition emerging from [9] for P systems: in most cases the computational power increases when moving from interleaving to maximal parallelism. Note that the undecidability of universal termination for MBD with maximal parallelism semantics does not contradict the decidability of universal termination for MBD with interleaving semantics provided in the present paper, as the well-quasi-ordering on systems sys defined in Section 4 is not compatible with the maximal parallelism reduction semantics.…”
Section: Resultssupporting
confidence: 61%
“…While interleaving semantics is the classical semantics for process calculi, the usual semantics in membrane computing is based on maximal parallelism: at each computational step, a maximal set of independent interactions must be executed simultaneously. As for many variants of P systems the computational power decreases when moving from the maximal parallelism to the interleaving semantics (see [9]), it seems worthwhile to investigate if the decidability of universal termination for MBD with the interleaving semantics also holds when moving to the maximal parallelism semantics. Concerning MBD with the maximal parallelism semantics, in [1] we provided a deterministic encoding of RAMs.…”
Section: Resultsmentioning
confidence: 99%
“…In [19], tissue P systems with channel states controlling the communication between two regions were proposed, and several Turing universality results were achieved, where the systems work in a maximally parallel way with sequential behavior on channels. In [20], a general model of tissue P systems with channel states that allow us to model hybrid cooperating grammar systems was considered, where the results were established for strings and arrays.…”
Section: Introductionmentioning
confidence: 99%
“…As an example, some sequential P systems [1], which assume the sequential application of appropriate evolution rules, have been proposed. As another example, two asynchronous P systems [3] have been proposed for solving the SAT and Hamiltonian cycle problem.…”
Section: Introductionmentioning
confidence: 99%