Membrane Calculus: a formal method for Grid transactions

The research of transaction processing in Web Services and Grid Services is active in academic and engineering areas. However, the formal method of transaction processing has not been fully investigated in the literature. This paper proposes a preliminary theoretical model called Membrane Calculus based on Membrane Computing and Petri nets to formalize Grid transactions. Five kinds of transition rules in Membrane Calculus (including object rules and membrane rules) are introduced and the operational semantics of transition rules are defined. Then, a typical long‐running transaction example is presented to demonstrate the use of Membrane Calculus. Finally, the rewriting logic tool Maude is adopted to specify and execute the specification of this example. Copyright © 2006 John Wiley & Sons, Ltd.

[1]  Gheorghe Paun,et al.  A guide to membrane computing , 2002, Theor. Comput. Sci..

[2]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..

[3]  Jinyuan You,et al.  P Systems and Petri Nets , 2003, Workshop on Membrane Computing.

[4]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[5]  Roberto Bruni,et al.  Transactions and Zero-Safe Nets , 2001, Unifying Petri Nets.

[6]  José Meseguer,et al.  Rewriting logic: roadmap and bibliography , 2002, Theor. Comput. Sci..

[7]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[8]  Carlos Martín-Vide,et al.  Computing with Membranes: Variants with an Enhanced Membrane Handling , 2001, DNA.

[9]  Laura Bocchi,et al.  A Calculus for Long-Running Transactions , 2003, FMOODS.

[10]  Minglu Li,et al.  Real-time transaction processing for autonomic Grid applications , 2004, Eng. Appl. Artif. Intell..

[11]  Roberto Bruni,et al.  Orchestrating Transactions in Join Calculus , 2002, CONCUR.

[12]  Narciso Martí-Oliet,et al.  The Maude 2.0 System , 2003, RTA.