Skip to main content
SpringerLink
Log in
Book cover

Transactions on Computational Collective Intelligence XXX pp 242–262Cite as

\(TCTL^{\varDelta }_h\) Model Checking of Time Petri Nets

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((TCCI,volume 11120))

Abstract

Concurrent systems are becoming tremendous in different fields such as network applications, communication protocols and client server applications. However, they are rather difficult to develop and especially, due to concurrency, these systems are faced to specific errors like deadlocks and livelocks. In this context, model checking is a promising formal method which permits systems analysis at early stage, thus ensuring prevention from errors occurring. In previous work [16], we proposed an extension of timed temporal logic TCTL with more powerful modalities aiming to specify properties with clocks quantifiers as well as features for transient states. We formally defined the syntax and the semantics of the proposed quantitative logic called \(TCTL^{\varDelta }_{h}\). As well as in [15], we used timed automata and region graph to discuss the applicability of the proposal to model checking by studying its decidability and complexity.

In this paper, we define a timed temporal logic \(TPN-TCTL^{\varDelta }_{h}\) for time Petri nets, for which model-checking is PSPACE-complete. In fact, Petri nets in general have gained a special interest due to their expressiveness power especially while dealing with concurrency. After detailing the proposed model checking method, we show its development and integration into the tool Romeo. Finally, we prove the efficiency of the method via case studies and simulation results.

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 EPUB and 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

References

  1. Alur, R.: Techniques for automatic verification of Real-Time System. Ph.D. thesis, Stanford University (1991)

    Google Scholar 

  2. Alur, R., Courcoubetis, C., Dill, D.: Model-checking in dense real-time. Inf. Comput. 104, 2–34 (1993)

    Article  MathSciNet  Google Scholar 

  3. Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. (TCS) 126, 183–235 (1994)

    Article  MathSciNet  Google Scholar 

  4. Berthomieu, B., Diaz, M.: Modeling and verification of time dependent systems using time Petri nets. IEEE Trans. Softw. Eng. 17, 259–273 (1991)

    Article  MathSciNet  Google Scholar 

  5. Berthomieu, B., Vernadat, F.: State class constructions for branching analysis of time Petri nets. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 442–457. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-36577-X_33

    Chapter  MATH  Google Scholar 

  6. Boucheneb, H., Gardey, G., Roux, O.H.: TCTL model checking of time Petri nets. J. Log. Comput. 19, 1509–1540 (2009)

    Article  MathSciNet  Google Scholar 

  7. Bruyère, V., Raskin, J.F.: Real-time model-checking: parameters everywhere. Log. Methods Comput. Sci. 3(1:7), 1–30 (2007)

    MathSciNet  MATH  Google Scholar 

  8. Emerson, E.A., Mok, A.K., Sistla, A.P., Srinivasan, J.: Quantitative temporal reasoning. In: Automatic Verification Methods for Finite State Systems, Grenoble, France, vol. 4, pp. 331–352 (1992)

    Article  Google Scholar 

  9. Emerson, E.A., Trefler, J.R.: Parametric quantitative temporal reasoning. In: Logic in Computer Science, pp. 336–343 (1999)

    Google Scholar 

  10. Gardey, G., Roux, O.H., Roux, O.F.: Using zone graph method for computing the state space of a time Petri net. In: Larsen, K.G., Niebert, P. (eds.) FORMATS 2003. LNCS, vol. 2791, pp. 246–259. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-40903-8_20

    Chapter  MATH  Google Scholar 

  11. Giua, A., DiCesare, F., Silva, M.: Generalized mutual exclusion constraints on nets with uncontrollable transitions. In: IEEE International Conference on SMC (1992)

    Google Scholar 

  12. Hadjidj, R., Boucheneb, H.: On the fly TCTL model checking for time Petri nets. Theor. Comput. Sci. 410(42), 4241–4261 (2009)

    Article  MathSciNet  Google Scholar 

  13. Hopcroft, J., Ullman, J.: Introduction to Automata Theory. Addison-Wesley, Reading (1979)

    Google Scholar 

  14. David Jansen, N., Roel Wieringa, J.: Reducing the extensions of CTL with actions and real time. Technical report, University of Twente, CTIT (2000)

    Google Scholar 

  15. Jbeli, N., Sbaï, Z., Ben Ayed, R.: \(TCTL^{\Delta }_{h}\) for quantitative verification of information systems. In: 4th International Workshop on Advanced Information Systems for Enterprises (IWAISE 2016) (2016)

    Google Scholar 

  16. Jbeli, N., Sbaï, Z., Ben Ayed, R.: On expressiveness of TCTL\(^{\varDelta }_h\) for model checking distributed systems. In: Nguyen, N.-T., Manolopoulos, Y., Iliadis, L., Trawiński, B. (eds.) ICCCI 2016. LNCS (LNAI), vol. 9875, pp. 323–332. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-45243-2_30

    Chapter  Google Scholar 

  17. Henzinger, T.A., Kupferman, O., Vardi, M.Y.: A space-efficient on-the-fly algorithm for real-time model checking. In: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 514–529. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-61604-7_73

    Chapter  Google Scholar 

  18. Laroussinie, F.: Model checking temporisé: Algorithmes efficaces et complexité. Master’s thesis, ENSCachan, Décembre 2005

    Google Scholar 

  19. Laroussinie, F., Turuani, M., Schnoebelen, Ph.: On the expressivity and complexity of quantitative branching-time temporal logics. Theor. Comput. Sci. 297(1–3), 437–446 (2000)

    Google Scholar 

  20. Lime, D., Roux, O.H.: Model checking of time Petri nets using the state class timed automaton. J. Discret. Events Dyn. Syst.-Theory Appl. (DEDS) 16(2), 179–205 (2006)

    Article  MathSciNet  Google Scholar 

  21. LSV: Dossier scientifique. Ecole Normale Supérieure de Cachan (2004)

    Google Scholar 

  22. Mathieu, S.: Méthodes qualitatives et quantitatives pour la détection d’information cachée. Ph.D. thesis, Université Pierre et Marie Curie (2011)

    Google Scholar 

  23. Mokadem, H.B.: Vérification des propriétés temporisées des automates programmables industriels. Ph.D. thesis, Ecole normale superieure de Cachan (2006)

    Google Scholar 

  24. Mokadem, H.B., Bérard, B., Bouyer, P., Laroussinie, F.: A new modality for almost everywhere properties in timed automata. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 110–124. Springer, Heidelberg (2005). https://doi.org/10.1007/11539452_12

    Chapter  Google Scholar 

  25. Mokadem, H.B., Bérard, B., Bouyer, P., Laroussinie, F.: Timed temporal logics for abstracting transient states. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol. 4218, pp. 337–351. Springer, Heidelberg (2006). https://doi.org/10.1007/11901914_26

    Chapter  MATH  Google Scholar 

  26. Yoneda, T., Ryuba, H.: CTL model checking of time Petri nets using geometric regions. IEICE Trans. Inf. Syst. E99–D(3), 297–396 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Engineering School of Tunis, Tunis El Manar University, BP. 37 Le Belvédère, 1002, Tunis, Tunisia

    Naima Jbeli, Zohra Sbaï & Rahma Ben Ayed

  2. College of Computer Engineering and Sciences, Prince Sattam Bin Abdulaziz University, PO Box 151, Al-Kharj, 11942, Kingdom of Saudi Arabia

    Zohra Sbaï

Authors
  1. Naima Jbeli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zohra Sbaï
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rahma Ben Ayed
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zohra Sbaï .

Editor information

Editors and Affiliations

  1. Wroclaw University of Science and Technology, Wroclaw, Poland

    Ngoc Thanh Nguyen

  2. Swinburne University of Technology, Hawthorn, SA, Australia

    Richard Kowalczyk

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Jbeli, N., Sbaï, Z., Ben Ayed, R. (2018). \(TCTL^{\varDelta }_h\) Model Checking of Time Petri Nets. In: Thanh Nguyen, N., Kowalczyk, R. (eds) Transactions on Computational Collective Intelligence XXX. Lecture Notes in Computer Science(), vol 11120. Springer, Cham. https://doi.org/10.1007/978-3-319-99810-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-99810-7_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-99809-1

  • Online ISBN: 978-3-319-99810-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation