Integrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systems

This paper presents some results of integrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systems. The intention of this research is to use predicate transition nets as a specification method and to use first order temporal logic as a verification method so that their strengths — the easy comprehension of predicate transition nets and the reasoning power of first order temporal logic can be combined. In this paper, a theoretical relationship between the computation models of these two formalisms is presented; an algorithm for systematically translating a predicate transition net into a corresponding temporal logic system is outlined; and a special temporal refutation proof technique is proposed and illustrated in verifying various concurrent properties of the predicate transition net specification of the five dining philosophers problem.

[1]  Leo Ojala,et al.  Tools ans Studies of Formal Techniques - Petri nets and Temporal Logic , 1983, Protocol Specification, Testing, and Verification.

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

[3]  Peter B. Andrews.  An introduction to mathematical logic and type theory - to truth through proof , 1986, Computer science and applied mathematics.

[4]  Michel Diaz,et al.  Specification and Validation of Protocols by Temporal Logic and Nets , 1983, IFIP Congress.

[5]  Xudong He,et al.  Integrating formal specification and verification methods in software development , 1989 .

[6]  Leslie Lamport,et al.  Artificial Intelligence and Language Processing ]acques Cohen Editor a Simple Approach to Specifying Concurrent Systems , 2022 .

[7]  C. Rattray,et al.  Specification and Verification of Concurrent Systems , 1990, Workshops in Computing.

[8]  Wolfgang Reisig,et al.  Petri Nets: Central Models and Their Properties , 1986, Lecture Notes in Computer Science.

[9]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

[10]  Kurt Lautenbach,et al.  Elements of General Net Theory , 1979, Advanced Course: Net Theory and Applications.

[11]  Howard Barringer.  Formal Specification Techniques for Parallel and Distributed Systems: A Survey , 1984 .

[12]  Alasdair Urquhart,et al.  Temporal Logic , 1971 .

[13]  Martín Abadi,et al.  A Timely Resolution , 1986, LICS.

[14]  Hartmann J. Genrich,et al.  Predicate/Transition Nets , 1986, Advances in Petri Nets.

[15]  Melvin Fitting,et al.  Tableau methods of proof for modal logics , 1972, Notre Dame J. Formal Log..

[16]  C. A. Petri.  Fundamentals of a Theory of Asynchronous Information Flow , 1962, IFIP Congress.

[17]  Kurt Lautenbach.  Linear Algebraic Techniques for Place/Transition Nets , 1986, Advances in Petri Nets.

[18]  Hsu-Chun Yen,et al.  A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets , 1988, Theor. Comput. Sci..

[19]  Peter Huber,et al.  Towards reachability trees for high-level Petri nets , 1985, European Workshop on Applications and Theory in Petri Nets.

[20]  Amir Pnueli,et al.  Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends , 1986, Current Trends in Concurrency.

[21]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[22]  John A. N. Lee,et al.  Deriving Temporal Logic Specifications from Predicate Transition Petri Net , 1989, International Conference on Software Engineering and Knowledge Engineering.

[23]  José Meseguer,et al.  On the Semantics of Petri Nets , 1992, CONCUR.

[24]  Lincoln A. Wallen.  Matrix Proof Methods for Modal Logics , 1987, IJCAI.

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

[26]  Leslie Lamport,et al.  Specifying Concurrent Program Modules , 1983, TOPL.