Executing Transactions in Zero-Safe Nets

Distributed systems are often composed by many heterogeneous agents that can work concurrently and exchange information. Therefore, in their modeling via pt nets we must be aware that the basic activities of each system can vary in duration and can be constituted by smaller internal activities, i.e., transitions are conceptually refined into transactions. We address the issue of modeling transactions in distributed systems by using zero-safe nets, which extend pt nets with a simple mechanism for transition synchronization. In particular, starting from the zero-safe net that represents a certain system, we give a distributed algorithm for executing the transactions of the system as transitions of a more abstract pt net. Among the advantages of our approach, we emphasize that the zero-safe net can be much smaller than its abstract counterpart, due to the synchronization mechanism.

[1]  Ursula Goltz,et al.  Refinement of actions and equivalence notions for concurrent systems , 2001, Acta Informatica.

[2]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[3]  Rob J. van Glabbeek.  Petri Nets, Configuration Structures and Higher Dimensional Automata , 1999, CONCUR.

[4]  T. Agerwala,et al.  Complete model for representing the coordination of asynchronous processes , 1974 .

[5]  Roberto Bruni,et al.  A Comparison of Petri Net Semantics under the Collective Token Philosophy , 1998 .

[6]  C. Petri.  Kommunikation mit Automaten , 1962 .

[7]  R. Bruni.  Tile Logic for Synchronized Rewriting of Concurrent Systems , 1999 .

[8]  Raymond R. Devillers,et al.  The box calculus: a new causal algebra with multi-label communication , 1992, Advances in Petri Nets: The DEMON Project.

[9]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[10]  Wilfried Brauer,et al.  A survey of behaviour and equivalence preserving refinements of Petri nets , 1991, Applications and Theory of Petri Nets.

[11]  Roberto Bruni,et al.  Zero-Safe Nets: Comparing the Collective and Individual Token Approaches , 2000, Inf. Comput..

[12]  Raymond R. Devillers,et al.  General Refinement and Recursion Operators for the Petri Box Calculus , 1993, STACS.

[13]  Wolfgang Reisig,et al.  The Non-sequential Behavior of Petri Nets , 1983, Inf. Control..

[14]  Ichiro Suzuki,et al.  A Method for Stepwise Refinement and Abstraction of Petri Nets , 1983, J. Comput. Syst. Sci..

[15]  Raymond R. Devillers,et al.  Sequential and Concurrent Behaviour in Petri Net Theory , 1987, Theor. Comput. Sci..

[16]  Roberto Bruni,et al.  Zero-Safe Nets: Composing Nets via Transition Synchronization , 1999 .

[17]  Tilak Agerwala,et al.  Comments on capabilities, limitations and “correctness” of Petri nets , 1973, ISCA 1973.

[18]  José Meseguer,et al.  Process versus Unfolding Semantics for Place/Transition Petri Nets , 1996, Theor. Comput. Sci..

[19]  Roberto Bruni,et al.  Zero-safe nets: The individual token approach , 1997, WADT.

[20]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[21]  Roberto Bruni,et al.  A Comparison of Petri Net Semantics under the Collective Token Philosophy , 1998, ASIAN.

[22]  Roberto Bruni,et al.  Zero-safe nets, or transition synchronization made simple , 1997, EXPRESS.

[23]  Walter Vogler,et al.  Behaviour Preserving Refinement of Petri Nets , 1986, WG.

[24]  Roberto Bruni,et al.  Functorial semantics for Petri nets under the individual token philosophy , 1999, CTCS.

[25]  Gordon D. Plotkin,et al.  Configuration structures , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[26]  Robert Valette,et al.  Analysis of Petri Nets by Stepwise Refinements , 1979, J. Comput. Syst. Sci..