Cycles and communicating classes in membrane systems and molecular dynamics
From MaRDI portal
Publication:872209
DOI10.1016/j.tcs.2006.11.027zbMath1111.68042OpenAlexW2098454959MaRDI QIDQ872209
Paolo Cazzaniga, Daniela Besozzi, Robert Brijder, Sanne Houweling, Dario Pescini, Michael Muskulus, Grzegorz Rozenberg
Publication date: 27 March 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.11.027
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (3)
An excursion in reaction systems: from computer science to biology ⋮ Applications of Page Ranking in P Systems ⋮ Experiments on the reliability of stochastic spiking neural P systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient solution of linear diophantine equations
- An efficient incremental algorithm for solving systems of linear diophantine equations
- Computing with membranes
- Hierarchical reachability graph generation for Petri nets
- Membrane computing. An introduction.
- P SYSTEMS WITH REACTION MAPS
- COMPLEXITY OF BIO-COMPUTATION: SYMBOLIC DYNAMICS IN MEMBRANE SYSTEMS
- DYNAMICAL PROBABILISTIC P SYSTEMS
- Analysis and Simulation of Dynamics in Probabilistic P Systems
- Markov Chains
- RELEVANT CYCLES IN CHEMICAL REACTION NETWORKS
- An open graph visualization system and its applications to software engineering
- Validation of Stochastic Systems
- Membrane Computing
- Some remarks on cycles in graphs and digraphs
This page was built for publication: Cycles and communicating classes in membrane systems and molecular dynamics