On P Systems with Bounded Parallelism

Authors:
Francesco Bernardini;Francisco J. Romero-Campero;Marian Gheorghe;Mario J. Perez-Jimenez;Maurice Margenstern;Sergey Verlan;Natalio Krasnogor
Affiliations:
University of Sheffield;University of Seville;University of Sheffield;University of Seville;Université de Metz;Université de Metz;University of Nottingham
Venue:
SYNASC '05 Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Year:
2005

Citing 0
Cited 6

Quorum sensing P systems

Theoretical Computer Science
Membrane computing and brane calculi. Old, new, and future bridges

Theoretical Computer Science
A Framework for Complexity Classes in Membrane Computing

Electronic Notes in Theoretical Computer Science (ENTCS)
Partial halting in P systems using membrane rules with permitting contexts

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Maximally Parallel Probabilistic Semantics for Multiset Rewriting

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions

Fundamenta Informaticae - Machines, Computations and Universality, Part I

Quantified Score

Hi-index	0.01

Visualization

Abstract

A framework that describes the evolution of P systems with bounded parallelism is defined by introducing basic formal features that can be then integrated into a structural operational semantics. This approach investigates a generic strategy of selecting membranes and rules and applying the rules. P systems with boundary rules are used to illustrate the case and an example dealing with an evolution strategy involving bounded parallelism is discussed.