Skip to main content
SpringerLink
Log in

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

  • Published:
Formal Aspects of Computing

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abadi, A. and Mannia, Z.: A Timely Resolution,Proc. Symp. on Logic Computer Science, pp. 176–186, 1986.

  2. Andrews, P. B.:An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof, Academic Press, 1986.

  3. Anttila, M., Eriksson, H. and Ikonen, J.: Tools and Studies of Formal Techniques-Petri Nets and Temporal Logic. In:Protocol Specification, Testing, and Verification, III, H. Rudin and C. H. West (eds), pp. 139–148, Elsevier Science Publishers, IFIP, 1983.

  4. Barringer, H.: Formal Specification Techniques for Parallel and Distributed Systems — A Short Review,Proc. 3rd Joint Ada Europe/AdaTEC Conference, J. Teller (ed.), Brussels, pp. 281–294, 1984.

  5. Brauer, W., Resig, W. and Rozenberg, G. (eds):Petri Nets: I — Central Models and Their Properties and II — Applications and Relationships to Other Models of Concurrency, LNCS 254 and 255, Springer-Verlag, 1987.

  6. Diaz, M. and Guidacci Da Silverira, G.: On the Specification and Validation of Protocols by Temporal Logic and Nets, inInformation Processing 83, Proc. IFIP83 Congress, Paris, pp. 47–52, Sept. 1983.

  7. Fitting, M. C.: Tableau Methods of Proof for Modal Logics,Notre Dame Journal of Formal Logic, XIII, 237–247 (1972).

    Google Scholar 

  8. Genrich, H. J.: Predicate Transition Nets, in LNCS 254, pp. 207–247, Springer-Verlag, 1987.

  9. Genrich, H. J. and Lautenbach, K.: System Modelling with High Level Petri Nets,Theoretical Computer Science, 13, 109–136 (1981).

    Google Scholar 

  10. Genrich, H. J., Lautenbach, K. and Thiagarajan, P. S.:Elements of Net Theory, LNCS 84, pp. 21–164, Springer-Verlag, 1980.

  11. He, X.: Integrating Formal Specification and Verification Methods in Software Development, Ph.D. Dissertation, Department of Computer Science, Virginia Polytechnic Institute & State University, 1989.

  12. He, X. and Lee, J. A. N.: Deriving Temporal Logic Specifications from Predicate Transition Petri Net Specifications,Proc. Int. Conf. on Software Engineering and Knowledge Engineering, Chicago, pp. 116–121, 15–17 June 1989.

  13. Howell, R. R., Rosier, L. E. and Yen, H. C.: A Taxomy of Fairness and Temporal Logic Problems for Petri Nets. In LNCS 324, pp. 351–359, Springer-Verlag, 1988.

  14. Huber, P., Jensen, A. M., Jepsen, L. O. and Jensen, K.: Towards Reachability Trees for High-Level Petri Nets. In: LNCS 188, pp. 215–233, Springer-Verlag, 1985.

  15. Lamport, L.: Specifying Concurrent Program Modules.ACM TOPLAS, 5, 190–222 1983.

    Google Scholar 

  16. Lamport, L.: A Simple Approach to Specifying Concurrent Systems.CACM, 32, 32–45 (1989).

    Google Scholar 

  17. Lautenbach, K.: Linear Algebraic Techniques for Place Transition Nets. In: LNCS 254, pp. 142–167, Springer-Verlag, 1987.

  18. Manna, Z. and Pnueli, A.: Verification of Concurrent Programs: the Temporal Framework. In:The Correctness Problem in Computer Science, R. S. Boyer and J. S. Moore (eds), pp. 215–274, Academic Press, 1981.

  19. Petri, C. A.: Fundamentals of a Theory of Asynchronous Information Flow. In:Information Processing 1962, pp. 386–390, North-Holland, 1962.

  20. Pnueli, A.: The Temporal Logic of Programs,19th Annual Symp. on Foundations of Computer Science, pp. 46–57, Nov. 1977.

  21. Pnueli, A.: Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends. In: LNCS 224, pp. 510–584, Springer-Verlag, 1986.

  22. Queille, J. P. and Sifakis, J.: Specification and Verification of Concurrent Systems in CESAR. In: LNCS 137, pp. 337–351, Springer-Verlag, 1982.

  23. Resig, W.:Petri Nets — An Introduction, Springer-Verlag, 1985.

  24. Resig, W.: On the Semantics of Petri Nets. In:Formal Models in Programming, E. J. Neuhold and G. Chroust (eds), pp. 347–372, IFIP, North-Holland, 1985.

  25. Rescher, N. and Urquhart, A.:Temporal Logic, Springer-Verlag, 1971.

  26. Wallen, L. A.: Matrix Proof Methods for Modal Logics,Proc. of 10th IJCAI, pp. 917–923, 1987.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, North Dakota State University, 58105-5075, Fargo, ND, USA

    Xudong He

  2. Department of Computer Science, Virginia Polytechnic Institute & State University, 24061, Blacksburg, VA, USA

    John A. N. Lee

Authors
  1. Xudong He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John A. N. Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

He, X., Lee, J.A.N. Integrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systems. Formal Aspects of Computing 2, 226–246 (1990). https://doi.org/10.1007/BF01888226

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01888226

Key words

Search

Navigation