Skip to main content
SpringerLink
Log in

Model Checking of Time Petri Nets Based on Partial Order Semantics

  • Conference paper
  • First Online:
CONCUR’99 Concurrency Theory (CONCUR 1999)

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

Included in the following conference series:

Abstract

Model checking of place/transition-nets based on partial order semantics has been applied successfully to the analysis of causal behaviour of distributed systems. Here, this approach is extended to the causal behaviour of time Petri nets. Expansion of a time Petri net to an equivalent P/T-net is defined, and it is shown that (an abstraction of) the McMillan unfolding of the expanded net is sufficient for model checking w.r.t. formulae of a simple branching time temporal logic L.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur, C. Courcoubetis, and D. Dill: Model Checking for Real-time Systems. Proc. 5th Symp. LICS (1990).

    Google Scholar 

  2. P. Amthor, H. Fleischhack, and J. Tapken: MOBY-more than a Tool for the Verification of SDL-Specifications. Technical Report, University of Oldenburg (1996).

    Google Scholar 

  3. T. Aura, J. Lilius: Time Processes for Time Petri Nets. Proc. ICATPN, Toulouse (1997).

    Google Scholar 

  4. B. Berthomieu, M. Diaz: Modelling and Verification of Time Dependent Systems Using Time Petri Nets. IEEE Transactions on Software Engineering, Volume 17/3, 259–273 (1991).

    Article  MathSciNet  Google Scholar 

  5. E. Best: Partial Order Verification with PEP. Proc. POMIV’96, Partial Order Methods in Verification, G. Holzmann, D. Peled, and V. Pratt (eds.), American Mathematical Society (1996).

    Google Scholar 

  6. B. Bieber, H. Fleischhack: Model Checking of Time Petri Nets Based on Partial Order Semantics. Techn. Rep., CvO University of Oldenburg (1999). URL: http://theoretica.informatik.uni-oldenburg.de/~max/paper/.

  7. E. M. Clarke, E. A. Emerson, and A. P. Sistla: Automatic Verification of Finitestate Concurrent Systems Using Temporal Logic Specifications. ACM TOPLAS 8, 244–263 (1986).

    Article  MATH  Google Scholar 

  8. J. Engelfriet: Branching Processes of Petri Nets, Acta Informatica, Volume 28, pages 575–591 (1991).

    Article  MATH  MathSciNet  Google Scholar 

  9. J. Esparza: Model Checking Using Net Unfoldings. Science of Computer Programming, Volume 23, 151–195, Elsevier (1994).

    Article  MATH  MathSciNet  Google Scholar 

  10. J. Esparza, S. Römer, and W. Vogler: An Improvement of McMillan’s Unfolding Algorithm. Proc. of TACAS’96 (1996).

    Google Scholar 

  11. H. Fleischhack: Efficient computation of processes for time Petri nets. University of Oldenburg (1999). (in preparation)

    Google Scholar 

  12. H. Fleischhack, and J. Tapken: An M-Net Semantics for a Real-Time Extension of μSDL, Proc. FME’97, Graz (1997).

    Google Scholar 

  13. P. Godefroid: Using partial orders to improve automatic verification methods. in Proc. Workshop on Computer Aided Verification (1990).

    Google Scholar 

  14. B. Graves: Identification of Specific Processes Contained in McMillan’s Finite Unfolding. in Proceedings of FSTTCS17, Kharagpur, India (1997).

    Google Scholar 

  15. J. Lilius: Efficient state space search for time Petri nets. MFCS Workshop on Concurrency (1998).

    Google Scholar 

  16. K. MacMillan: Symbolic Model Checking-an Approach to the State Explosion Problem. PhD Thesis, SCS, Carnegie Mellon University (1992).

    Google Scholar 

  17. K. L. McMillan: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. Proc. CAV’ 92, Fourth Workshop on ComputerAided Verification, Vol. 663 of Lecture Notes in Computer Science, 164–174 (1992).

    Google Scholar 

  18. P. Merlin, D. Farber: Recoverability of Communication Protocols-Implication of a Theoretical Study. IEEE Transactions on Software Communications, Vol. 24, 1036–1043 (1976).

    Article  MATH  MathSciNet  Google Scholar 

  19. X. Nicollin, J. Sifakis, and S. Yovine: From ATP to Timed Graphs and Hybrid Systems. Lecture Notes in Computer Science, Real Time: Theory in Practice (1992).

    Google Scholar 

  20. L. Popova: On Time Petri Nets. Journal of Information Processing and Cybernetics, Volume 1055 of Lecture Notes in Computer Science, Springer (1991).

    Google Scholar 

  21. A. Semenov, A. Yakovlev, and A. Koelmans: Time Petri net unfoldings and hardware verification. University of Newcastle (1998) (Draft).

    Google Scholar 

  22. P. Starke: Analyse von Petri-Netz-Modellen. Teubner Verlag, Stuttgart (1990) (in German).

    MATH  Google Scholar 

  23. I. Virbitskaite, E. Pokozy: On Partial Order Verification of Time Petri Nets. University of Novosibirsk (1998) (Draft).

    Google Scholar 

  24. T. Yoneda, B.-H. Schlingloff: Efficient Verification of Parallel Real-Time Systems. Journal of Formal Methods in System Design, Vol. 11-2, 187–215 (1997).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Carl-von-Ossietzky — Universität Oldenburg, D-26111, Oldenburg

    Burkhard Bieber & Hans Fleischhack

Authors
  1. Burkhard Bieber
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans Fleischhack
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten  & Sjouke Mauw  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bieber, B., Fleischhack, H. (1999). Model Checking of Time Petri Nets Based on Partial Order Semantics. In: Baeten, J.C.M., Mauw, S. (eds) CONCUR’99 Concurrency Theory. CONCUR 1999. Lecture Notes in Computer Science, vol 1664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48320-9_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-48320-9_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66425-3

  • Online ISBN: 978-3-540-48320-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation