Journal of Computer and System Sciences
Handbook of Formal Languages
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction
Membrane Computing: An Introduction
P Systems with Gemmation of Mobile Membranes
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Molecular Computing with Generalized Homogeneous P-Systems
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Gemmating P systems: collapsing hierarchies
Theoretical Computer Science
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
P systems working in the sequential mode on arrays and strings
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Multiset random context grammars, checkers, and transducers
Theoretical Computer Science
P Systems with Proteins on Membranes
Fundamenta Informaticae
Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
P systems with minimal parallelism
Theoretical Computer Science
Membrane Computing and Brane Calculi (Some Personal Notes)
Electronic Notes in Theoretical Computer Science (ENTCS)
Expressiveness Issues in Brane Calculi: A Survey
Electronic Notes in Theoretical Computer Science (ENTCS)
Membrane computing and brane calculi. Old, new, and future bridges
Theoretical Computer Science
Processes of membrane systems with promoters and inhibitors
Theoretical Computer Science
Computing with cells: membrane systems-some complexity issues
International Journal of Parallel, Emergent and Distributed Systems
Computational expressiveness of Genetic Systems
Theoretical Computer Science
Strategy-Based Proof Calculus for Membrane Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A Petri net model for membrane systems with dynamic structure
Natural Computing: an international journal
A Notion of Biological Diagnosability Inspired by the Notion of Opacity in Systems Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Process semantics for membrane systems
Journal of Automata, Languages and Combinatorics
A modeling approach based on p systems with bounded parallelism
WMC'06 Proceedings of the 7th international conference on Membrane Computing
On the computational power of the mate/bud/drip brane calculus: interleaving vs. maximal parallelism
WMC'05 Proceedings of the 6th international conference on Membrane Computing
P systems, petri nets, and program machines
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Towards a petri net semantics for membrane systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
On the computational power of brane calculi
Transactions on Computational Systems Biology VI
Properties of membrane systems
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Parallel and distributed algorithms in p systems
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode
Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS
P Systems with Proteins on Membranes
Fundamenta Informaticae
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Hi-index | 0.00 |
In the area of P systems, applying the rules in a maximally parallel way is one of the most common features of many models introduced so far. Whereas the idea of membranes as well as many operations and rules used in membrane systems have a concrete biological background, the universal clock assumed to control the parallel application of rules is unrealistic, but on the other hand relevant for many interesting theoretical results, especially when proving computational completeness and solving computationally hard problems. Based on a quite general definition of tissue P systems, we investigate several models of P systems and compare their computational power in the classic case (i.e., applying the rules in the maximally parallel mode) and in the case of applying the rules in an asynchronous way (i.e., an arbitrary number of rules may be applied in one derivation step) or in the sequential mode (i.e., exactly one rule is applied in one derivation step). Moreover, we also recall some results for (tissue) P systems working in an asynchronous or sequential mode already in the original definition. Finally, we also raise several questions for future research in this subarea of (tissue) P systems working in the asynchronous mode and (tissue) P systems working in the sequential mode.