Skip to main content
SpringerLink
Log in

Proving temporal properties of Petri nets

  • Conference paper
  • First Online:
Advances in Petri Nets 1991 (ICATPN 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 524))

Included in the following conference series:

Abstract

We present a sound and complete tableau system for proving temporal properties of Petri nets, expressed in a propositional modal mucalculus which subsumes many other temporal logics. The system separates the checking of fix-points from the rest of the logic, which allows the use of powerful reasoning, perhaps specific to a class of nets or an individual net, to prove liveness and fairness properties. Examples are given to illustrate the use of the system. The proofs of soundness and completeness are given in detail.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

9. References

  • Best, E. [1986]. Structure theory of Petri nets: the free choice hiatus. Advances in Petri Nets 1986, Part I. LNCS 254.

    Google Scholar 

  • Bradfield, J. C., Stirling, C. P. [1991]. Local model-checking for infinite state spaces. To appear in Theoretical Computer Science.

    Google Scholar 

  • Clarke, E. M., Emerson, E. A., Sistla, A. P. [1983]. Automatic verification of finitestate concurrent systems using temporal logic specifications: a practical approach. Proc. Tenth ACM Symposium on Principles of Programming Languages. ACM, Austin, Texas.

    Google Scholar 

  • Emerson, E. A., Lei, C.-L. [1986]. Efficient model checking in fragments of the propositional mu-calculus. Proc. First IEEE Symposium on Logic in Computer Science (267–278). Computer Society Press.

    Google Scholar 

  • Hüttel, H. [1990] SnS can be modally characterized. Theoretical Computer Science 74 (239–248).

    Google Scholar 

  • Kozen, D. [1983]. Results on the propositional mu-calculus. Theoretical Computer Science 27.

    Google Scholar 

  • Lautenbach, K. [1986]. Linear algebraic techniques for place/transition nets. Advances in Petri Nets 1986, Part I. LNCS 254.

    Google Scholar 

  • Pratt, V. [1981]. A decidable mu-calculus. Proc. 22nd IEEE Foundations of Computer Science.

    Google Scholar 

  • Stirling, C. P., Walker, D. J. [1989]. Local model checking in the modal mu-calculus. Proc. International Joint Conference on Theory and Practice of Software Development (369–382). LNCS 351.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Edinburgh, The King's Buildings, EH9 3JZ, Edinburgh, U.K.

    J. C. Bradfield

Authors
  1. J. C. Bradfield
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bradfield, J.C. (1991). Proving temporal properties of Petri nets. In: Rozenberg, G. (eds) Advances in Petri Nets 1991. ICATPN 1990. Lecture Notes in Computer Science, vol 524. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019967

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54398-5

  • Online ISBN: 978-3-540-47600-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation