Non-linear invariants for coloured Petri nets with interdependent tokens; application to the proof of parallel programs

We consider the way coloured Petri nets can be used as an abstract model for parallel programs. Then we present a kind of nets for which a large class of invariants can be proved directly on the structure of the net. We show, by means of examples, how these invariants can be used to establish partial correctness of programs.

[1]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[2]  Kurt Jensen.  High-Level Petri Nets , 1982, European Workshop on Applications and Theory of Petri Nets.

[3]  Zohar Manna,et al.  Verification of concurrent programs, Part I: The temporal framework , 1981 .

[4]  Kurt Lautenbach,et al.  S-Invariance in Predicate/Transition Nets , 1982, European Workshop on Applications and Theory of Petri Nets.

[5]  Robert S. Boyer,et al.  The Correctness Problem in Computer Science , 1982 .

[6]  Jacques Vautherin,et al.  Computation of flows for unary-predicates/transition-nets , 1984, European Workshop on Applications and Theory in Petri Nets.

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

[8]  Jacques Vautherin.  Un modèle algébrique, basé sur les réseaux de Petri, pour l'étude des systèmes parallèles , 1985 .

[9]  Wolfgang Reisig,et al.  CSP-programs with individual tokens , 1984, European Workshop on Applications and Theory in Petri Nets.

[10]  Patrick Cousot,et al.  Invariance proof methods and analysis techniques for parallel programs , 1984 .

[11]  Kurt Lautenbach,et al.  System Modelling with High-Level Petri Nets , 1981, Theor. Comput. Sci..

[12]  Kurt Lautenbach,et al.  Use of Petri Nets for Proving Correctness of Concurrent Process Systems , 1974, IFIP Congress.

[13]  P. Ladet,et al.  Modelling and validation of complex systems by coloured Petri nets; Application to a flexible manufacturing system , 1985, European Workshop on Applications and Theory in Petri Nets.