Skip to main content
SpringerLink
Log in

Modular state space exploration for timed petri nets

  • Special Section CPN 04/05
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

Abstract

This paper extends modular state space construction for concurrent systems to cater for timed systems. It identifies different forms of timed state space and presents algorithms for computing them. These include uniprocessor algorithms inspired by conservative and optimistic approaches to discrete event simulation, and also a distributed algorithm. The paper discusses implementation issues and performance results for a simple case study.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aalst W. (1993). Interval Timed Coloured Petri Nets and their analysis. In: Marsan, M.A. (eds) Internation Conference on the Application and Theory of Petri Nets, vol. 961 of LNCS., pp 453–472. Springer, Chicago

    Google Scholar 

  2. Berthelot G., Boucheneb H. (1994). Occurrence graphs for Interval Timed Coloured Nets. In: Proceedings of 15th International Conference Application and Theory of Petri Nets (ICATPN’1994), Zaragoza, Spain, June 1994, vol. 815 of LNCS, pp 79–98. Springer, Berlin

  3. Boucheneb, H., Bertholet, G.: Towards a simplified building of Time Petri Nets reachability graph. In: 5th International Workshop on Petri Nets and Performance Models, pp 46–55. Springer, Berlin (1993)

  4. Christensen S. and Petrucci L. (2000). Modular analysis of Petri Nets. Comput. J. 43(3): 224–242

    Article  MATH  Google Scholar 

  5. Design/CPN online. http://www.daimi.au.dk/designCPN

  6. Fujimoto R.M. (1990). Parallel discrete event simulation. Commun. ACM 33(10): 30–53

    Article  Google Scholar 

  7. Jensen K. (1992). Coloured Petri Nets: basic concepts, analysis methods and practical use, vol. 1: Basic Concepts. Monographs in Theoretical Computer Science. Springer, Berlin

    Google Scholar 

  8. Jensen K. (1994). Coloured Petri Nets: basic concepts, analysis methods and practical use. vol. 2: Analysis Methods. Monographs in Theoretical Computer Science. Springer, Berlin

    Google Scholar 

  9. Kristensen, L., Petrucci, L.: An approach to distributed state space exploration for Coloured Petri Nets. In: Proceedings of 25th International Conference Application and Theory of Petri Nets (ICATPN’2004), Bologna, Italy, June 2004, vol. 3099 of LNCS, pp 474–483. Springer, Berlin (2004)

  10. Lakos, C., Petrucci, L.: Modular analysis of systems composed of semiautonomous subsystems. In: Proceedings of 4th International Conference on Application of Concurrency to System Design (ACSD’04), Hamilton, Canada, June 2004, pp 185–194. IEEE Comp. Soc. Press (2004)

  11. Lewis, G.A.: Incremental specification and analysis in the context of Coloured Petri Nets. Ph.D., Department of Computing, University of Tasmania, 2002

  12. Mäkelä M. (2002). Model checking safety properties in Modular High-level Nets. In: Best, E. (eds) 24th International Conference on the Application and Theory of Petri Nets, Eindhoven, The Netherlands vol. 2679 of LNCS., pp 201–220. Springer, Berlin

    Google Scholar 

  13. Mäkelä, M.: Maria - Modular reachability analyzer for Algebraic System Nets (Version 1.3.4). Technical report, Helsinki University of Technology, Laboratory for Theoretical Computer Science, June 2003

  14. Penczek W. and Polrola A. (2004). Specification and model checking of temporal properties in Time Petri Nets and Timed Automata. In: Cortadella, J. and Reisig, W. (eds) International Conference on the Application and Theory of Petri Nets, vol 3099 of Lecture Notes in Computer Science, Florida., pp 37–76. Springer, Berlin

    Google Scholar 

  15. Petrucci, L.: Cover picture story: experiments with modular state spaces. Petri Net Newslett. 68:Cover page and 5–10, April 2005

  16. Virbitskaite I. and Pokozy E. (1999). A partial order method for the verification of Time Petri Nets. In: Ciobanu, G. and Paun, G. (eds) Fundamentals of Computation Theory, vol. 1684 of Lecture Notes in Computer Science., pp 547–558. Springer, Berlin

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Adelaide, Adelaide, SA, 5005, Australia

    C. Lakos

  2. LIPN, CNRS UMR 7030, Université Paris XIII, 99, avenue Jean-Baptiste Clément, 93430, Villetaneuse, France

    L. Petrucci

Authors
  1. C. Lakos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Petrucci
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to L. Petrucci.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lakos, C., Petrucci, L. Modular state space exploration for timed petri nets. Int J Softw Tools Technol Transfer 9, 393–411 (2007). https://doi.org/10.1007/s10009-007-0033-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10009-007-0033-2

Keywords

Search

Navigation