Petri nets: an introduction
Journal of Computer and System Sciences
Well-structured transition systems everywhere!
Theoretical Computer Science
P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Term Rewriting Systems
Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
P Systems with Gemmation of Mobile Membranes
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Gemmating P systems: collapsing hierarchies
Theoretical Computer Science
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Catalytic P systems, semilinear sets, and vector addition systems
Theoretical Computer Science
On the power of membrane division in P systems
Theoretical Computer Science - Words, languages and combinatorics
BioAmbients: an abstraction for biological compartments
Theoretical Computer Science - Special issue: Computational systems biology
Computation: finite and infinite machines
Computation: finite and infinite machines
P Systems with Proteins on Membranes
Fundamenta Informaticae
On Reachability and Spatial Reachability in Fragments of BioAmbients
Electronic Notes in Theoretical Computer Science (ENTCS)
A Biologically Inspired Model with Fusion and Clonation of Membranes
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Reachability Analysis in BioAmbients
Electronic Notes in Theoretical Computer Science (ENTCS)
On the dynamics of PB systems with volatile membranes
WMC'07 Proceedings of the 8th international conference on Membrane computing
Signaling p systems and verification problems
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Reachability problems in BioAmbients
Theoretical Computer Science
| Hi-index | 0.00 |
We study computational properties of Gheorge P驴un's P-systems extended with rules that model in an abstract way creation, dissolution, fusion and cloning of membranes. We investigate decision problems like reachability of a configuration, boundedness (finiteness of the state space), and coverability (verification of safety properties). Our analysis is aimed at understanding the expressive power of rules that dynamically modify the structure of a membrane.