A new methodology for analyzing distributed systems modeled by petri nets

Distributed computing systems can be modeled adequately by Petri nets. The computation of invariants of Petri nets becomes necessary for proving the properties of modeled systems. This paper presents a two-phase, bottom-up approach for invariant computation and analysis of Petri nets. In the first phase, a newly defined subnet, called the RP-subnet, with an invariant is chosen. In the second phase, the selected RP-subnet is analyzed. Our methodology is illustrated with two examples viz., the dining philosophers' problem and the connection-disconnection phase of a transport protocol. We believe that this new method, which is computationally no worse than the existing techniques, would simplify the analysis of many practical distributed systems.

[1]  Dilip Sarkar,et al.  Reflexive Incidence Matrx (RIM) Representation of Petri Nets , 1987, IEEE Transactions on Software Engineering.

[2]  Kurt Jensen How to Find Invariants for Coloured Petri Nets , 1981, MFCS.

[3]  Michel Hack,et al.  ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS , 1972 .

[4]  P. Merlin,et al.  Specification and Validation of Protocols , 1979, IEEE Trans. Commun..

[5]  N. K. Nanda,et al.  A Petri net approach to the evaluation of the complexity of a program , 1981 .

[6]  C. V. Ramamoorthy,et al.  Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets , 1980, IEEE Transactions on Software Engineering.

[7]  Kurt Jensen,et al.  Coloured Petri Nets and the Invariant-Method , 1981, Theor. Comput. Sci..

[8]  G. S. Hura,et al.  Optimization of assembly code generation using Petri nets , 1980 .

[9]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[10]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

[11]  Alexander H. Levis,et al.  Petri net representation of decision models , 1985, IEEE Transactions on Systems, Man, and Cybernetics.

[12]  Ajoy Kumar Datta,et al.  Synthesis of a Class of Deadlock-Free Petri Nets , 1984, JACM.

[13]  Gérard Berthelot,et al.  Petri Nets Theory for the Correctness of Protocols , 1982, PSTV.

[14]  Tilak Agerwala,et al.  Special Feature: Putting Petri Nets to Work , 1979, Computer.

[15]  Joël Favrel,et al.  Hierarchical reduction method for analysis and decomposition of Petri nets , 1985, IEEE Transactions on Systems, Man, and Cybernetics.

[16]  T. Agerwala,et al.  Putting Petri nets to work , 1989 .