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
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
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
Acta Informatica
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
On the verification of membrane systems with dynamic structure
Natural Computing: an international journal
| Hi-index | 0.00 |
P-systems represent an important class of biologically inspired computational models. In this paper, we study computational properties of a variation of P-systems with rules that model in an abstract way fusion and clonation of membranes. We focus our attention on extended P-systems with an interleaving semantics and symbol objects and we investigate decision problems like reachability of a configuration, boundedness (finiteness of the state space), and coverability (verification of safety properties). In particular we use the theory of well-structured transition systems to prove that both the coverability and the boundedness problems are decidable for PB systems with fusion and clonation. Our results represent a preliminary step towards the development of automated verification procedures for concurrent systems with biologically inspired operations like fusion and clonation.