An algebraic approach to transactional processes

Abstract We present a set of operators in order to simplify the modelling of transactional behaviour of processes using process algebra. We give an axiomatic semantics of the operators presented. Apart from that, we give their operational semantics using Plotkin-style deduction rules. Our goal is to give formal speci¯cations of Internet applications using process algebra, for which transactional behaviour should be modelled.

[1]  Hector Garcia-Molina,et al.  Altruistic locking , 1994, TODS.

[2]  Andreas Reuter,et al.  Principles of transaction-oriented database recovery , 1983, CSUR.

[3]  Jim Gray,et al.  The Transaction Concept: Virtues and Limitations (Invited Paper) , 1981, VLDB.

[4]  Andreas Reuter,et al.  Transaction Processing: Concepts and Techniques , 1992 .

[5]  J. D. Day,et al.  A principle for resilient sharing of distributed resources , 1976, ICSE '76.

[6]  Philip A. Bernstein,et al.  Concurrency Control in Distributed Database Systems , 1986, CSUR.

[7]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[8]  Sjouke Mauw,et al.  Operational semantics of DiCons : a formal language for developing internet applications , 2001 .

[9]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[10]  Jos C. M. Baeten,et al.  Specifying internet applications with DiCons , 2001, SAC.

[11]  Dushan Z. Badal.  Correctness of concurrency control and implications in distributed databases , 1979, COMPSAC.

[12]  Frank S. de Boer,et al.  Asynchronous communication in process algebra , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[13]  Daniel J. Rosenkrantz,et al.  Distributed database concurrency controls using before-values , 1981, SIGMOD '81.

[14]  Chris Verhoef,et al.  Concrete process algebra , 1995, LICS 1995.

[15]  Jan A. Bergstra,et al.  Process Algebra with Asynchronous Communication Mechanisms , 1984, Seminar on Concurrency.

[16]  J. Bergstra,et al.  Fixed point semantics in process algebras : (preprint) , 1982 .

[17]  Gerhard Weikum,et al.  A theoretical foundation of multi-level concurrency control , 1985, PODS.

[18]  Jan A. Bergstra,et al.  Process Algebra with Backtracking , 1993, REX School/Symposium.

[19]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[20]  Hans-Jörg Schek,et al.  Concepts and Applications of Multilevel Transactions and Open Nested Transactions , 1992, Database Transaction Models for Advanced Applications.

[21]  Wan Fokkink.  The Tyft/Tyxt Format Reduces to Tree Rules , 1994, TACS.

[22]  R. Shapiro,et al.  Reliability and fault recovery in distributed processing , 1977 .

[23]  Irving L. Traiger,et al.  The notions of consistency and predicate locks in a database system , 1976, CACM.