Strategy-Based Rewrite Semantics for Membrane Systems Preserves Maximal Concurrency of Evolution Rule Actions

We use a modal logic in order to show that the strategy-based rewrite semantics for membrane systems fully preserves the maximal concurrency of evolution rules actions, whereas the maximal concurrency of communication actions and structural actions is partially preserved. Consequently, the strategy-based rewrite semantics describes more faithfully the behavior of the membrane systems than the rewrite logic-based semantics. It is known that the rewrite logic-based semantics implements the maximal concurrency of the evolution rules in membrane systems only by interleaving concurrency. The concurrency degrees of the communication and structural actions are the same for the two rewrite-based semantics.

[1]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[2]  Gabriel Ciobanu,et al.  A rewriting logic framework for operational semantics of membrane systems , 2007, Theor. Comput. Sci..

[3]  Gabriel Ciobanu,et al.  Rewriting Logic Specification of Membrane Systems with Promoters and Inhibitors , 2008, WRLA.

[4]  Enno Ohlebusch,et al.  Term Rewriting Systems , 2002 .

[5]  Gheorghe Stefanescu,et al.  Defining and Executing P Systems with Structured Data in K , 2009, Workshop on Membrane Computing.

[6]  José Meseguer,et al.  Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report , 1996, CONCUR.

[7]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[8]  Chang Liu,et al.  Term rewriting and all that , 2000, SOEN.

[9]  Dorel Lucanu,et al.  Strategy-Based Proof Calculus for Membrane Systems , 2009, WRLA.

[10]  José Meseguer,et al.  A Rewriting Semantics for Maude Strategies , 2009, WRLA.

[11]  Roberto Bruni,et al.  Semantic foundations for generalized rewrite theories , 2006, Theor. Comput. Sci..

[12]  José Meseguer,et al.  Specification and proof in membership equational logic , 2000, Theor. Comput. Sci..

[13]  Grigore Rosu,et al.  K: A Rewriting-Based Framework for Computations -- Preliminary version -- , 2007 .

[14]  Madhavan Mukund,et al.  Models and logics for true concurrency , 1992 .

[15]  Gabriel Ciobanu,et al.  Expressing Control Mechanisms of Membranes by Rewriting Strategies , 2006, Workshop on Membrane Computing.

[16]  José Meseguer,et al.  Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations , 1992, Theor. Comput. Sci..

[17]  Jonathan L. Gross,et al.  Handbook of graph theory , 2007, Discrete mathematics and its applications.

[18]  MeseguerJosé.  Conditional rewriting logic as a unified model of concurrency , 1992 .

[19]  José Meseguer,et al.  Membership algebra as a logical framework for equational specification , 1997, WADT.