ESTL: A Temporal Logic for Events and States

  • Ekkart Kindler
  • Tobias Vesper
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1420)


In some phases of system development state-based methods are adequate; in others event-based methods are adequate. Petri nets provide a system model which supports both methods and thus allow a smooth transition between the different phases of system development. Most temporal logics for Petri nets, however, do not support both methods.

In this paper we introduce a temporal logic for Petri nets which allows to argue about states as well as to argue about events. This way, specifications in the early phases can be event-based and verification in later phases can be state-based within a single formalism.


Temporal logic events states Petri nets system development specification verification 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Wil van der Aalst. Three good reasons for using a Petri-net-based workflow management system. In S. Navathe and T. Wakayama, editors, Proceedings of the International Working Conference on Information and Process Integration in Enterprises, pages 179–201, Cambridge, Massachusetts, 1996.Google Scholar
  2. 2.
    Eike Best and César Fernández. Nonsequential Processes, EATCS Monographs on Theoretical Computer Science 13. Springer-Verlag, 1988.Google Scholar
  3. 3.
    Felix Cornelius, Heinrich Hußmann, and Michael Löwe. The KORSO case study for software engineering with formal methods: A medical information system. In M. Broy and S. Jähnichen, editors, KORSO: Methods, Languages, and Tools for the Construction of Correct Software, LNCS 1009, pages 417–445. Springer-Verlag, 1995.CrossRefGoogle Scholar
  4. 4.
    Claudia Ermel, Magdalena Gajewsky, Tobias Vesper, and Michael Weber. Verifikation strukturierter Netze. In H. Weber, H. Ehrig, and W. Reisig, editors, Move-On-Workshop, DFG-Forschergruppe Petri Net Technology. Technical University Berlin, 1997.Google Scholar
  5. 5.
    Ursula Goltz and Wolfgang Reisig. The non-sequential behaviour of Petri nets. Information and Control, 57:125–147, 1983.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Ekkart Kindler and Wolfgang Reisig. Algebraic system nets for modelling distributed algorithms. Petri Net Newsletter, 51:16–31, 1996.Google Scholar
  7. 7.
    Ekkart Kindler, Wolfgang Reisig, Hagen Völzer, and Rolf Walter. Petri net based verification of distributed algorithms: An example. Formal Aspects of Computing, 9:409–424, 1997.zbMATHCrossRefGoogle Scholar
  8. 8.
    Ekkart Kindler and Tobias Vesper. A temporal logic for events and states in Petri nets. In B. Farwer, D. Moldt, and M.-O. Stehr, editors, Petri Nets in System Engineering, pages 101–110, Hamburg, 1997.Google Scholar
  9. 9.
    David A. Marca and Clement L. McGowan. SADT: Structured Analysis and Design Technique. McGraw-Hill, 1988.Google Scholar
  10. 10.
    Zohar Manna and Amir Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Specification. Springer-Verlag, 1992.Google Scholar
  11. 11.
    Wolfgang Reisig. Petri Nets, EATCS Monographs on Theoretical Computer Science 4. Springer-Verlag, 1985.Google Scholar
  12. 12.
    Wolfgang Reisig. Petri nets and algebraic specifications. Theoretical Computer Science, 80:1–34, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Wolfgang Reisig. Petri net models of distributed algorithms. In J. van Leeuven, editor, Computer Science Today: Recent Trends and Developments, LNCS 1000, pages 441–454. Springer-Verlag, Berlin, 1995.Google Scholar
  14. 14.
    Wolfgang Reisig. Interleaved progress, concurrent progress, and local progress. In D.A. Peled, V.R. Pratt, and G.J. Holzmann, editors, Partial Order Methods in Verification, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 29, pages 99–115. AMS, 1997.Google Scholar
  15. 15.
    Wolfgang Reisig. Elements of Distributed Algorithms. Modeling and Analysis with Petri Nets. In preparation, Springer-Verlag, 1998.Google Scholar
  16. 16.
    Douglas T. Ross. Structured Analysis (SA): A language for communicating ideas. IEEE Software Engineering Transactions, 3(1):16–37, January 1977.CrossRefGoogle Scholar
  17. 17.
    Antonia Sinachopoulos. Temporal logics of elementary net systems. Arbeitspapiere der GMD 353, 1988.Google Scholar
  18. 18.
    Michael Weber, Rolf Walter, Hagen Völzer, Tobias Vesper, Wolfgang Reisig, Sibylle Peuker, Ekkart Kindler, Jörn Freiheit, and Jörg Desel. DAWN: Petrinetzmodelle zur Verifikation Verteilter Algorithmen. Informatik-Bericht 88, Humboldt-University Berlin, December 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Ekkart Kindler
    • 1
  • Tobias Vesper
    • 1
  1. 1.Institut für InformatikHumboldt-Universität zu BerlinBerlin

Personalised recommendations