Advertisement

New structural invariants for Petri nets analysis

  • J. M. Couvreur
  • E. Paviot-Adet
Full Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 815)

Abstract

This paper introduces two new kinds of invariant relations based on the Petri net structure and the already proved invariant properties. These invariants establish a relation between the marking of two place subsets A and B: Exclusive Invariant states that A and B cannot be simultaneously marked, Implication Invariant states that when A is marked, B is also marked. In order to show the applicability of the presented invariants to the validation of models, we apply these invariants to the validation of two classical distributed algorithms: alternate bit protocol and Peterson's algorithm for n processes

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Chandy, Misra 88]
    Chandy K.M. and Misra J. “Parallel Program Design: A Foundation”. Addison-Wesley Publishing Compagny, 1988, 516 pages.Google Scholar
  2. [Dijkstra 81]
    E.W. Dijkstra, “An assertional proof of a program by G.L. Peterson”. EWD 779, Burroughs Corp. 1981.Google Scholar
  3. [Hoare 83]
    Hoare C.A.R., “Toward a Theory of Parallel Programming”. Operating Systems Techniques, Hoare and Perrots (eds), Academic Press New York, 1972, p. 61–71.Google Scholar
  4. [Lamport 77]
    Lamport L., “Proving the Correctness of Multiprocess Programs”. IEEE Transactions on Software Engineering, vol. SE-3:2, March 1977, p. 125–143.Google Scholar
  5. [Nguyen et al. 86]
    Nguyen V., Demers A., Gries D. and Owicki S., “A model and Temporal Proof System for Network of Processes”. Distributed Computing, Springer Verlag, 1986, p. 7–25.Google Scholar
  6. [Morgan, Razouk 87]
    Morgan E.T. and Razouk R.R., “Interactive State-Space Analysis of Concurrent Systems”. IEEE Transactions on Software Engineering, vol. 13, no 10, October 1987, p. 1080–1091.Google Scholar
  7. [Murata 89]
    Murata T., “PetriNets: Properties, Analysis and Applications”. Proceedings of the IEEE, vol. 77, no. 4, April 1989, p. 541–580.Google Scholar
  8. [Peterson 81]
    G.L. Peterson, “Myths about the Mutual Exclusion Problem”. Information Processing Letters, 12:3. June 1981, p. 115–116.CrossRefGoogle Scholar
  9. [Suzuki 90]
    Suzuki I., “Formal Analysis of the Alternating Bit Protocol by Temporal Petri Nets”. IEEE Transactions on Software Engineering, vol. 16, no 11, November 1990, p. 1273–1281.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • J. M. Couvreur
    • 1
  • E. Paviot-Adet
    • 1
  1. 1.Laboratoire MASI, Institut Blaise PascalUniversité Paris VIParis Cedex 05France

Personalised recommendations