Flattening the transition P systems with dissolution

DOI10.1007/978-3-642-18123-8_7zbMATH Open1259.68050OpenAlexW1961356397MaRDI QIDQ3067484FDOQ3067484

Authors: Oana Agrigoroaiei, Gabriel Ciobanu 

Publication date: 21 January 2011

Published in: Membrane Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18123-8_7

Recommendations

• Flattening in (tissue) P systems
• Flattening and simulation of asynchronous divisionless P systems with active membranes
• Simulating P systems with membrane dissolution in a chemical calculus
• Membrane Computing
• Flat maximal parallelism in P systems with promoters

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited In (10)

• Synchronization of rules in membrane computing
• Testing based on identifiable P systems using cover automata and X-machines
• Verification of membrane systems with delays via Petri nets with delays
• Modeling membrane systems using colored stochastic Petri nets
• Simulating P systems with membrane dissolution in a chemical calculus
• Flattening and simulation of asynchronous divisionless P systems with active membranes
• Quantitative Causality in Membrane Systems
• Catalytic and communicating Petri nets are Turing complete
• The power of synchronizing rules in membrane computing
• Flattening in (tissue) P systems

This page was built for publication: Flattening the transition P systems with dissolution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3067484)