Modular verification of Petri Nets

The temporal logic approach
  • Werner Damm
  • Gert Döhmen
  • Volker Gerstner
  • Bernhard Josko
Technical Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 430)


"How does reactive behaviour decompose? What can be done to encourage stepwise refinement of the behavioural aspects of a system? How can one cope with the intricacy, that the behaviour of a complex reactive system presents??" These questions, posed in [HP85] and informally discussed there in the setting of statecharts, are taken up in this paper using a particular class of Petri-Nets as models for open reactive systems. It presents an assumption/commitment style temporal logic [Pn85] for specifying the behaviour of such systems, an automatic proof method for verifying the correctness of an implementation of such a specification in terms of the considered class of Petri-Nets based on modelchecking of MCTL formula (discussed in a companion paper [Jo89]), and presents a proof-method for infering the behaviour of a compound reactive system from the behaviour of its constituents.

Key words

Petri nets temporal logic specification verification modular system design computer architecture 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BK83]
    H.Barringer, R.Kuiper: A Temporal Logic Specification Method Supporting Hierarchical Development, University of Manchester, 1983Google Scholar
  2. [BKP84]
    H.Barringer, R.Kuiper, A.Pnueli: Now You May Compose Temporal Logic Specifications, Proc. 16th ACM Symposium on Theory of Computing, 1984, 51–63Google Scholar
  3. [CES83]
    E.M. Clarke, E.A. Emerson, A.P. Sistla: Automatic verification of finite-state concurrent systems using temporal logic specifications: a practical approach. Tenth ACM Symposium on principles of Programming Languages (1983)Google Scholar
  4. [DD88]
    W. Damm, G. Döhmen: Specifying Distributed Computer Architectures in AADL, Parallel Computing, Vol 9, 1988, 193–211Google Scholar
  5. [DD89]
    W.Damm, G.Döhmen: AADL: a Net-Based Specification Method for Computer Architecture Design, in: Languages for Parallel Architectures: Design, Semantics, and Implementation Models", edt. Bakker, Wiley & Sons, 1989Google Scholar
  6. [DDG89]
    W.Damm, G.Döhmen, V.Gerstner, J.Helbig, B.Josko, F.Korf, T.Peikenkamp: AADL Language Document, University of Oldenburg, FRG, 1989Google Scholar
  7. [DGM 88]
    P.Degano, R.Gorrieri, S.Machetti: An excercise in concurrency: a CSP process as a Condition/Event system, Advances on Petri-Nets 1988, edt G.Rozenberg, Lecture Notes in Computer science 340, Springer Verlag, 1988, 83–105Google Scholar
  8. [EC 83]
    E.A. Emerson, E.M. Clarke: Using branching time temporal logic to synthesisze synchronization skeletons, Science of Computer Programming, Vol 2, 1982, 241–266CrossRefGoogle Scholar
  9. [EH83]
    E.A. Emerson, J.Y. Halpern: Sometimes and not never revisited: On branching time versus linear time. 10th ACM Symposium on Principles of programming Languages. 1983Google Scholar
  10. [EH85]
    E.A. Emerson, J.Y. Halpern: Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Science 30 (1985), pp. 1–24CrossRefGoogle Scholar
  11. [HO83]
    B. Hailpern, S. Owicki: Modular Verification of Computer Communication Protocols, IEEE Trans. on Communication, Vol COM-31, 1983,56–68Google Scholar
  12. [HP85]
    D.Harel, A.Pnueli: On the Development of Reactive Systems, Nato ASI Series, Vol. F13, Logics and Models of Concurrent Systems, edt. K.Apt, Springer Verlag, 1985Google Scholar
  13. [JG80]
    M.Jazayeri, C.Ghezzi, D.Hoffman,. D.Middleton, M.Smotherman: Design and Implementation of a Language for Communicating Sequential Processes, IEEE Proc. 9th Int.Conf. on Parallel Processes, Harbor Spring, Michigan, USA, 1980Google Scholar
  14. [Jo87]
    B. Josko: Modelchecking of CTL formulae under liveness assumptions. Proceedings ICALP 87. Lecture Notes in Computer Science 267 (1987), 280–289Google Scholar
  15. [Jo89]
    B. Josko: Verifying the correctness of AADL-modules using model checking. Proceedings REX-Workshop on Stepwise refinement of Distributed systems: models, formalisms, correctnessGoogle Scholar
  16. [Ko 87]
    F. Korf: M-CSP — eine modulare Sprache mit Prozeßkommunikation und ihre Implemntierung, Master Thesis, RWTH Aachen, 1987Google Scholar
  17. [MC 81]
    J. Misra, K.M. Chandy: Proofs of Networks of Processes, IEEE Trans. Software Enginering. 7, 1981, 417–426Google Scholar
  18. [MW84]
    Z. Manna,P. Wolper: Synthesis of Communicating Processes from Temporal Logic Specifications, ACM Toplas 6, 1984, 68–93Google Scholar
  19. [NGO 85]
    V.Nguyen, D.Gries, S.Owicki: A Model and Temporal Proof System for Network of Proceses, 12 POPL, 1985, 121–131Google Scholar
  20. [Occam]
    OCCAM Programming Manual, INMOS Ltd, Whitefriars, Lewins Mead, Bristol, EnglandGoogle Scholar
  21. [Pn85]
    A.Pnueli: In transition from Global to Modular Temporal Reasoning about Programs, in: Logics and Models of Concurrent Systems, edt. K.R.Apt, Springer Verlag, 1985, 123–144Google Scholar
  22. [Pn86]
    A. Pnueli, Applications of Temporal Logic to the Specification and Verification of Reactive Systems: a Survey of Current Trends, in: Current Trends in Concurrency, edts. Bakker, W.-P. de Roever, G.Rozenberg, Lecture Notes in Computer Science 224, Springer Verlag, 1986, 510–584Google Scholar
  23. [Re 84]
    W. Reisig: Partial Order Semantics versus Interleaving Semantics of CSP-like languages and its Impact on Fairness, Lecture Notes in Computer Science 172, Springer Verlag, 1984, 403–413Google Scholar
  24. [Wo82]
    S.P. Wolper: Specification and Synthesis of Communicating Processes using an extended Temporal Logic, POPL 82, 1982, 20–33Google Scholar
  25. [Wo86]
    P.Wolper: Expressing INteresting Properties of Programs in Propositional Temporal Logic, 13th POPL, 1986, 184–193Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Werner Damm
    • 1
  • Gert Döhmen
    • 1
  • Volker Gerstner
    • 1
  • Bernhard Josko
    • 1
  1. 1.FB 10, University of OldenburgOldenburgFed. Rep. of Germany

Personalised recommendations