Journal of Computer and System Sciences
Well-structured transition systems everywhere!
Theoretical Computer Science
Membrane Computing: An Introduction
Membrane Computing: An Introduction
P Systems without Priorities Are Computationally Universal
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Computationally universal P systems without priorities: two catalysts are sufficient
Theoretical Computer Science - Descriptional complexity of formal systems
Computation: finite and infinite machines
Computation: finite and infinite machines
Deterministic catalytic systems are not universal
Theoretical Computer Science - Implementation and application of automata
On deterministic catalytic systems
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Compositional semantics and behavioral equivalences for P Systems
Theoretical Computer Science
A P Systems Flat Form Preserving Step-by-step Behaviour
Fundamenta Informaticae
WMC'07 Proceedings of the 8th international conference on Membrane computing
Modeling dependencies and simultaneity in membrane system computations
Theoretical Computer Science
Properties of membrane systems
CMC'11 Proceedings of the 12th international conference on Membrane Computing
A P Systems Flat Form Preserving Step-by-step Behaviour
Fundamenta Informaticae
New algorithm for solving nonlinear equations roots
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories
Simulation of Spatial P system models
Theoretical Computer Science
| Hi-index | 5.23 |
P systems are a biologically inspired model introduced by Gheorghe Paun with the aim of representing the structure and the functioning of the cell. Since their introduction, several variants of P systems have been proposed and explored. We concentrate on the class of catalytic P systems without priorities associated with the rules. We show that the theory of Well-Structured Transition Systems can be used to decide the divergence problem (i.e. checking for the existence of an infinite computation) for such a class of P systems. As a corollary, we obtain an alternative proof of the nonuniversality of deterministic catalytic P systems, an open problem recently solved by Ibarra and Yen.