Skip to main content
SpringerLink
Log in

Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets

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

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

Included in the following conference series:

Abstract

The paper deals with verification of untimed branching time properties of Time Petri Nets. The atomic variant of the geometric region method for preserving properties of CTL* and ACTL* is improved. Then, it is shown, for the first time, how to apply the partial order reduction method to deal with next-time free branching properties of Time Petri Nets. The above two results are combined offering an efficient method for model checking of ACTL *_ x and CTL *_ x properties of Time Petri Nets

Partly supported by the State Committee for Scientific Research under the grant No. 8T11C 01419

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 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, C. Courcoubetis, and D. Dill, Model Checking for Real-Time Systems, Proc. of LICS’90, IEEE, 1990, pp. 414–425.

    Google Scholar 

  2. R. Alur and D. Dill, Automata for Modelling Real-Time Systems, Theoretical Computer Science 126(2) (1994), 183–236.

    Article  MATH  MathSciNet  Google Scholar 

  3. R. Alur, T. Feder, and T. Henzinger, The Benefits of Relaxing Punctuality, Journal of ACM 43(1) (1996), 116–146.

    Article  MATH  MathSciNet  Google Scholar 

  4. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu, Symbolic Model Checking without BDDs, Proc. of DAT’99, 1999.

    Google Scholar 

  5. M.C. Browne, E.M. Clarke, and O. Grumberg, Characterizing Finite Kripke Structures in Propositional Temporal Logic, Theoretical Computer Science 59 (1988), 115–131.

    Article  MathSciNet  MATH  Google Scholar 

  6. B. Berthomieu and M. Diaz, Modelling and Verification of Time Dependent Systems Using Time Petre Nets, IEEE Trans. on Software Eng. 17(3) (1991), 259–273.

    Article  MathSciNet  Google Scholar 

  7. [BJLW98]J. Bengtsson, B. Jonsson, J. Lilius, and Y. Wang, Partial Order Reductions for Timed Systems, LNCS 1466 (1998), 485–500.

    Google Scholar 

  8. R. Bryant, Graph-based Algorithms for Boolean Function Manipulation, IEEE Transaction on Computers 35(8) (1986), 677–691.

    Article  MATH  Google Scholar 

  9. D. Dams, O. Grumberg, and R. Gerth, Abstract Interpretation of Reactive Systems: Abstractions Preserving ACTL*, ECTL* and CTL*, Proceedings of the IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET), North-Holland, 1994.

    Google Scholar 

  10. D. Dams, R. Gerth, B. Knaack, and R. Kuiper, Partial-Order Reduction Techniques for Real-Time Model Checking, Proc. of 3rd Int. Workshop on Formal Methods for Industrial Critical Systems, 1998, pp. 157–169.

    Google Scholar 

  11. D. Dill, Timing Assumptions and Verification of Finite State Concurrent Systems, LNCS 407 (1989), 197–212.

    Google Scholar 

  12. A. Emerson and A.P. Sistla, Symmetry and Model Checking, Formal Methods in SystemDesign 7 (1996), 105–131.

    Article  Google Scholar 

  13. U. Goltz, R. Kuiper, and W. Penczek, Propositional Temporal Logics and Equivalences, LNCS 630 (1992), 222–236.

    Google Scholar 

  14. R. Gerth, R. Kuiper, D. Peled, and W. Penczek, A Partial Order Reductions to Branching Time Logic Model Checking, Information and Computation 150 (1999), 132–152.

    Article  MATH  MathSciNet  Google Scholar 

  15. O. Grumberg and D.E. Long, Model Checking and Modular Verification, LNCS 527 (1991), 250–265.

    Google Scholar 

  16. G.J. Holzmann and D. Peled, An Improvement in Formal Verification, Proc. of FORTE’94, Formal Description Techniques, Chapman and Hall, 1994, pp. 197–211.

    Google Scholar 

  17. J. Lilius, Efficient State Space Search for Time Petri Nets, Proc. MFCS’98 Workshop on Concurrency, ENTCS, vol. 18, Springer-Verlag, 1999, p. 21.

    Google Scholar 

  18. M. Minea, Partial Order Reductions for Model Checking of Timed Automata, LNCS 1664 (1999), 431–446.

    Google Scholar 

  19. F. Pagani, Partial Orders and Verification of Real Time Systems, LNCS 1135 (1996), 327–346.

    Google Scholar 

  20. D. Peled, Partial Order Reduction: Linear and Branching Temporal Logics and Process Algebras, POMIV’96, Partial Order Methods in Verification, American Mathematical Society, DIMACS, 1996, pp. 79–88.

    Google Scholar 

  21. A. Półrola, Generation of Reduced Abstract State Spaces for Time Petri Nets, Report ICS PAS (2001), to appear.

    Google Scholar 

  22. W. Penczek, M. Szreter, R. Gerth, and R. Kuiper, Improving Partial Order Reductions for Branching Time Properties, Fundamenta Informaticae 43 (2000), 245–267.

    MATH  MathSciNet  Google Scholar 

  23. Ch. Rouff, teditor, Proc. of Formal Approaches to Agent-Based Systems, Springer-Verlag, 2001, to appear.

    Google Scholar 

  24. P. Starke, Analyse von Petri-Netz-Modellen, Teubner Verlag, 1990.

    Google Scholar 

  25. A. Valmari, Stubborn Sets for Reduced State Space Generation, Proc. of the 10th International Conference on Application and Theory of Petri Nets, LNCS, vol. 483, Springer-Verlag, 1989, pp. 491–515.

    Google Scholar 

  26. A. Valmari, Stubborn Set Methods for Process Algebras, Proc. POMIV’96, Partial Order Methods in Verification, Americal Mathematical Society, 1996, pp. 213–222.

    Google Scholar 

  27. I.B. Virbitskaite and E.A. Pokozy, A Partial Order Method for the Verification of Time Petri Nets, LNCS 1684 (1999), 547–558.

    Google Scholar 

  28. P. Wolper and P. Godefroid, Partial-Order Methods for Temporal Verification, LNCS 715 (1993), 233–246.

    Google Scholar 

  29. T. Yoneda and H. Ryuba, CTL Model Checking of Time Petri Nets Using Geometric Regions, IEICE Trans. Inf. and Syst. 3 (1998), 1–10.

    Google Scholar 

  30. T. Yoneda and B.H. Schlingloff, Efficient Verification of Parallel Real-Time Systems, Formal Methods in System Design 11(2) (1997), 197–215.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ICS PAS, Ordona 21, 01-237, Warsaw, Poland

    Wojciech Penczek

  2. Faculty of Mathematics, University of Lodz, Banacha 22, 90-238, Lodz, Poland

    Agata Półrola

Authors
  1. Wojciech Penczek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Agata Półrola
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Informática e Ingeniería de Sistemas Centro Politécnico Superior, Universidad de Zaragoza, María de Luna, 3, 50015, Zaragoza, Spain

    José-Manuel Colom

  2. Department of Computing Science, University of Newcastle upon Tyne, Newcastle upon Tyne, NE1 7RU, UK

    Maciej Koutny

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Penczek, W., Półrola, A. (2001). Abstractions and Partial Order Reductions for Checking Branching Properties of Time 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_19

Download citation

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

  • 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

Search

Navigation