Skip to main content
SpringerLink
Log in
Book cover

International Conference on Application and Theory of Petri Nets

ICATPN 2002: Application and Theory of Petri Nets 2002 pp 163–181Cite as

Computing a Finite Prefix of a Time Petri Net

  • Conference paper
  • First Online:

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

Abstract

Recently, model checking of Petri nets based on partial order semantics w.r.t. temporal logic formulae has been extended to time Petri nets. In this paper, we present an improved algorithm for computing the McMillan-unfolding of a time Petri net which gives a finite representation of the partial order semantics and some experimental results of its implementation within the PEP tool.

This work has been partially supported by the the Procope projects BAT (Box Algebra with Time) and PORTA (Partial Order Real Time Semantics).

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi and L. Lamport: An Old-Fashioned Recipe for Real-Time. In Real Time: Theory in Practice. Volume 600 of LNCS. Springer-Verlag (1992) 1–27

    Chapter  Google Scholar 

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

    Google Scholar 

  3. T. Aura and J. Lilius: A causal semantics for time Petri nets. In Theoretical Computer Science, Vol 243, No. 1–2 (2000) 409–447

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  6. B. Bieber and H. Fleischhack: Model Checking of Time Petri Nets Based on Partial Order Semantics. In Proceedings of CONCUR’99. Volume 1664 of LNCS. Springer-Verlag (1999) 210–225

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  10. J. Esparza, S. Römer, and W. Vogler: An Improvement of McMillan’s Unfolding Algorithm. In Proc. of TACAS’96. Volume 1055 of LNCS. Springer-Verlag (1996) 87–106

    Google Scholar 

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

    Google Scholar 

  12. P. Godefroid: Using partial orders to improve automatic verification methods. In Proc. Workshop on Computer Aided Verification (1990) 176–185

    Google Scholar 

  13. B. Graves: Computing Reachability Properties Hidden in Finite Net Unfoldings. In Proc. of FST&TCS’97. Volume 1346 of LNCS. Springer-Verlag (1997) 327–341

    Google Scholar 

  14. K. Heljanko: Minimizing Finite Complete Prefixes. In Proceedings of CS&P’99. Warsaw University (1999) 83–95

    Google Scholar 

  15. K. Heljanko, V. Khomenko and M. Koutny: Parallelisation of the Petri Net Unfolding Algorithm. To appear in Proc. of TACAS’2002. Grenoble, France (2002)

    Google Scholar 

  16. V. Khomenko, and M. Koutny: Towards An Efficient Algorithm for Unfolding Petri Nets. In Proc. of CONCUR’2001, K. G. Larsen, M. Nielsen (Eds.). Volume 2154 of LNCS. Springer-Verlag (2001) 366–380.

    Google Scholar 

  17. K. Larsen, P. Petterson and W. Yi: Model-Checking for Real-Time Systems. In Proc. of Fundamentals of Computation Theory. Volume 965 of LNCS. Springer-Verlag (1995) 62–88.

    Google Scholar 

  18. J. Lilius: Efficient State Space Search for Time Petri Nets. In MFCS Workshop on Concurrency. Volume 18 of ENTCS. Elsevier (1998).

    Google Scholar 

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

    Google Scholar 

  20. K. L. McMillan: Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In Proc. Workshop on Computer Aided Verification Volume 663 of LNCS. Springer-Verlag (1992) 164–174

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  22. X. Nicollin, J. Sifakis, and S. Yovine: From ATP to Timed Graphs and Hybrid Systems. Acta Informatica 30. Springer-Verlag (1993) 181–202

    Article  MATH  MathSciNet  Google Scholar 

  23. PEP homepage http://parsys.informatik.uni-oldenburg.de/~pep

  24. L. Popova: On Time Petri Nets. Journal of Information Processing and Cybernetics. EIK 27:4 (1991) 227–244.

    MATH  Google Scholar 

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

    Google Scholar 

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

    MATH  Google Scholar 

  27. C. Stehno: Entfaltung von Zeit-Petrinetzen, Integration in das PEP-System und Optimierungen. University of Oldenburg (2000) (Master thesis, in german)

    Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Hans Fleischhack & Christian Stehno

Authors
  1. Hans Fleischhack
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Stehno
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Division of Informatics, University of Edinburgh, James Clerk Maxwell Building, The King’s Buildings Mayfield Road, Edinburgh, EH9 3JZ, UK

    Javier Esparza

  2. Department of Computer Science, University of Adelaide, North Terrace, Adelaide, SA, 5005, Australia

    Charles Lakos

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fleischhack, H., Stehno, C. (2002). Computing a Finite Prefix of a Time Petri Net. In: Esparza, J., Lakos, C. (eds) Application and Theory of Petri Nets 2002. ICATPN 2002. Lecture Notes in Computer Science, vol 2360. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48068-4_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-48068-4_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43787-1

  • Online ISBN: 978-3-540-48068-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation