Skip to main content

Condensed State Spaces for Timed Petri Nets

  • Conference paper
  • First Online:
Applications and Theory of Petri Nets 2001 (ICATPN 2001)

Abstract

We present a state space method for Petri nets having a time concept based on a global clock and associating time stamps to tokens. The method is based on equivalence on states and makes it possible to condense the usually infinite state space of such timed Petri nets into a finite state space without loosing analysis power. The practical application of the method is demonstrated on a large example of an audio/video protocol by means of a computer tool implementing the method.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur and T. Henzinger. Logics and Models of Real Time: A Survey. In Real-Time: Theory in Practice, volume 600 of Lecture Notes in Computer Science, pages 74–106. Springer-Verlag, 1991.

    Chapter  Google Scholar 

  2. G. Berthelot. Occurrence Graphs for Interval Timed Coloured Nets. In Proceedings of ICATPN’94, volume 815 of Lecture Notes in Computer Science, pages 79–98. Springer Verlag, 1994.

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. S. Christensen, J. B. Jørgensen, and L. M. Kristensen. Design/CPN-A Computer Tool for Coloured Petri Nets. In E. Brinksma, editor, Proceedings of TACAS’97, volume 1217 of Lecture Notes in Computer Science, pages 209–223. Springer-Verlag, 1997.

    Google Scholar 

  5. S. Christensen and J.B. Jørgensen. Analysis of Bang and Olufsen’s BeoLink Audio/Video System Using Coloured Petri Nets. In P. Azéma and G. Balbo, editors, Proceedings of ICATPN’97, volume 1248 of Lecture Notes in Computer Science, pages 387–406. Springer-Verlag, 1997.

    Google Scholar 

  6. G. Ciardo, L. Cherkasova, V. Kotov, and T. Rokicki. Modeling a Scaleable High-Speed Interconnect with Stochastic Petri Nets. In Proceeding of PNPM’95, pages 83–93. IEEE Computer Society Press, 1995.

    Google Scholar 

  7. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic Verification of Finite State Concurrent Systems using Temporal Logic. ACM Transactions on Programming Languages and Systems, 8(2):244–263, 1986.

    Article  MATH  Google Scholar 

  8. H. Clausen and P. R. Jensen. Validation and Performance Analysis of Network Algorithms by Coloured Petri Nets. In Proceedings of PNPM’93, pages 280–289. IEEE Computer Society Press, 1993.

    Google Scholar 

  9. J. Desel and W. Reisig. Place/Transition Petri Nets. In Lecture on Petri Nets I: Basic Models, volume 1491 of Lecture Notes in Computer Science, pages 122–173. Springer-Verlag, 1998.

    Google Scholar 

  10. E. A. Emerson. Temporal and Modal Logic, volume B of Handbook of Theoretical Computer Science, chapter 16, pages 995–1072. Elsevier, 1990.

    Google Scholar 

  11. E. A. Emerson, A.K. Mok, A.P Sistla, and J. Srinivasan. Quantitative Temporal Reasoning. In Proceedings of CAV’90, volume 531 of Lecture Notes in Computer Science, pages 136–145. Springer-Verlag, 1990.

    Google Scholar 

  12. K. Jensen. Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Volume 1, Basic Concepts. Monographs in Theoretical Computer Science. Springer-Verlag, 1992.

    Google Scholar 

  13. K. Jensen. Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Volume 2, Analysis Methods. Monographs in Theoretical Computer Science. Springer-Verlag, 1994.

    Google Scholar 

  14. L. M. Kristensen, S. Christensen, and K. Jensen. The Practitioner’s Guide to Coloured Petri Nets. International Journal on Software Tools for Technology Transfer, 2(2):98–132, December 1998.

    Article  MATH  Google Scholar 

  15. M. A. Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis. Modelling with Generalized Stochastic Petri Nets. Series in Parallel Computing. Wiley, 1995.

    Google Scholar 

  16. T. Murata. Petri Nets: Properties, Analysis and Application. In Proceedings of the IEEE, Vol. 77, No. 4. IEEE Computer Society, 1989.

    Google Scholar 

  17. W. M. P. van der Aalst. Interval Timed Coloured Petri Nets and their Analysis. In Proceedings of ICATPN’93, volume 691 of Lecture Notes in Computer Science, pages 453–472. Springer Verlag, 1993.

    Google Scholar 

  18. K. M. van Hee, L. J. Somers, and M. Voorhoeve. Executeable Specifications for Distributed Information Systems. In Proceedings of IFIP TC8/WG 8.1 Working Conference on Information Systsm Concepts, pages 139–156. Elsevier Science Publishers, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Christensen, S., Kristensen, L.M., Mailund, T. (2001). Condensed State Spaces for Timed Petri Nets. In: Colom, JM., Koutny, M. (eds) Applications and Theory of Petri Nets 2001. ICATPN 2001. Lecture Notes in Computer Science, vol 2075. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45740-2_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-45740-2_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45740-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics