Skip to main content
SpringerLink
Log in

Improving state class constructions for CTL* model checking of time Petri nets

  • Regular Contribution
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

Abstract

The state space explosion is still one of the most challenging problems in formal verification using enumerative techniques. The challenge is even greater for real time systems whose state spaces are generally infinite due to time density. To use enumerative techniques with these systems, their state spaces need to be contracted into finite structures that preserve properties of interest. We propose in this paper an efficient approach to construct a contraction of the time Petri net model state space, which preserves its CTL* properties.

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.

Similar content being viewed by others

References

  1. Alur, R., Dill, D.: Automata for modelling real-time systems. In: Proceedings of ICALP’90. LNCS, vol. 443, pp. 322–335. Springer, Berlin (1990)

  2. Behrmann, G., Bengtsson, J., David, A., Larsen, K.G., Pettersson, P., Yi, W.: Uppaal implementation secrets. In: Proceedings of LNCS, vol. 2469, pp. 3–22. Springer, Berlin (2002)

  3. Berthomieu, B., Menasche, M.: An enumerative approach for analyzing time Petri nets. In: Proceedings of the IFIP 9th World Computer Congress, Information Processing, vol. 9, pp. 41–46. IFIP, North Holland, September 1983

  4. Berthomieu, B., Vernadat, F.: State class constructions for branching analysis of time Petri nets. In: Proceedings of TACAS’03, LNCS, vol. 2619, pp. 442–457. Springer, Berlin (2003)

  5. Boucheneb, H., Mullins, J.: Analyse de rTseaux de Petri temporels. calculs des classes en O(n 2) et des temps de chemin en O(m ×  n). Tech. Sci. Inf. 22(4), (2003)

  6. Bucci G., Vicario E. (1995). Compositional validation of time-itical systems using communicating time Petri nets. IEEE Trans. Softw. Eng. 21(12): 969–992

    Article  Google Scholar 

  7. Daws, C., Olivero, A., Tripakis, S., Yovine, S.: The tool kronos. In: Proceedings of Hybrid Systems III, Verification and Control, LNCS, vol. 1066, pp. 208–219. Springer, Berlin (1996)

  8. Fisler, K., Vardi, M.Y.: Bisimulation and model checking. LNCS, vol. 1703, pp. 338–341 (1999)

  9. Gardey, G., Roux, O.H., Roux, O.F.: Using zone graph method for computing the state space of a time Petri net. In: Proceedings of FORMATS’03, LNCS, vol. 2791, pp. 246–259. Springer, Berlin (2003)

  10. Henzinger, T., Ho, P.: Hytech: The cornell hybrid technology tool. In: Proceedings of Hybrid Systems II. LNCS, vol. 999, pp. 265–293. Springer, Berlin (1995)

  11. Larsen K.G., Weise C., Yi W., Pearson J. (1999). Clock difference diagrams. Nordic J. Comput. 26(3): 271–298

    MathSciNet  Google Scholar 

  12. Paige R., Tarjan R. (1987). Three partition refinement algorithms. SIAM J. Comput. 16(6): 973–989

    Article  MATH  MathSciNet  Google Scholar 

  13. Penczek, W., Polrola, A.: Abstractions and partial order reductions for checking branching properties of time Petri nets. In: Proceedings of ICATPN’01, LNCS, vol. 2075, pp. 323–342. Springer, Berlin (2001)

  14. Penczek, W., Polrola, A.: Specification and model checking of temporal properties in time Petri nets and timed automata. In: Proceedings of ICATPN’04, pp. 37–76 (2004)

  15. Pettersson, P.: Modelling and verification of real-time systems using timed automata: theory and practice. Ph.D. Theses. Uppsala University, 1999

  16. Rokicki, T.G.: Representing and modeling digital circuits. Ph.D. Theses. Stanford University, 1993

  17. Tarasyuk, I.V.: Tau-equivalences and refinement. In: Proceedings of International Refinement Workshop and Formal Methods Pacific - 98 (IRW/FMP’98), pp. 110–128 (1998)

  18. Vicario E. (2001). Static analysis and dynamic steering of time dependent systems. IEEE Trans. Soft. Eng. 27(8): 728–748

    Article  Google Scholar 

  19. Yoneda, T., Ryuba H. (1998). CTL model checking of time Petri nets using geometric regions. IEICE Trans. Inf. Syst. 3: 1–10

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, École Polytechnique de Montréal, P.O. Box 6079, Station Centre-ville, Montréal, QC, Canada

    Rachid Hadjidj & Hanifa Boucheneb

Authors
  1. Rachid Hadjidj
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hanifa Boucheneb
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hanifa Boucheneb.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hadjidj, R., Boucheneb, H. Improving state class constructions for CTL* model checking of time Petri nets. Int J Softw Tools Technol Transf 10, 167–184 (2008). https://doi.org/10.1007/s10009-007-0040-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10009-007-0040-3

Keywords

Search

Navigation