Abstract
Systems analysis is becoming more and more important in different fields such as network applications, communication protocols and client server applications. This importance is seen from the fact that these systems are faced to specific errors like deadlocks and livelocks which may in the major cases cause disasters. In this context, model checking is a promising formal method which permits systems analysis at early stage, thus ensuring prevention from errors occurring. In this paper, we propose an extension of timed temporal logic TCTL with more powerful modalities called \(TCTL^{\varDelta }_{h}\). This logic permits to combine in the same property clocks quantifiers as well as features for transient states. We formally define the syntax and the semantics of the proposed quantitative logic and we show via examples its expressive power.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alur, R., Courcoubetis, C., Dill, D.: Model-checking in dense real-time, 2–34 (1993). Berlin
Alur, R., Dill, D.: A theory of timed automata. Theoretical Comput. Sci. (TCS) 126, 183–235 (1994)
Alur, R., Henzinger, T.A.: A really temporal logic. J. ACM 41(1), 181–203 (1994)
Alur, R., Henzinger, T.A.: Automatic symbolic verification of embedded systems. IEEE Trans. Softw. Eng. 22, 181–201 (1996)
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)
Bérard, B.: Model checking temporisé. In: Roux, O.H., Jard, C. (eds.) Approches formelles des systemes embarqués communicants. Hermes/Lavoisier (2008)
Bruyère, V., Raskin, J.F.: Real-time model-checking: parameters everywhere. Log. Methods Comput. Sci. 3(1:7) (2007)
Emerson, E.A., Mok, A.K., Sistla, A.P., Srinivasan, J.: Quantitative temporal reasoning. In: Automatic Verifiation Methods for Finite State Systems, Grenoble, France (1992)
Emerson, E.A., Trefler, J.R.: Parametric Quantitative Temporal Reasoning. University of Texas, USA (1999)
Hadjidj, R., Boucheneb, H.: On-the-fly TCTL model-checking for time Petri nets. Theor. Comput. Sci. 410(42), 4241–4261 (2009)
Henzinger, T., Manna, Z., Pnueli, A.: Timed transition systems (1992)
Jansen, D.N., Wieringa, R.: Reducing the extensions of CTL with actions, real time. Technical report, Universiteit Twente: CTIT, Enschede, December 2000
Laroussinie, F.: Model checking temporisé: Algorithmes efficaces et complexité. Master’s thesis, ENSCachan, Décembre (2005)
Laroussinie, F., Turuani, M., Schnoebelen, P.: On the expressivity and complexity of quantitative branching-time temporal logics. Theor. Comput. Sci. 297, 297–315 (2003)
LSV. Dossier scientifique. Ecole Normale Supérieure de Cachan (2004)
Mathieu, S.: Méthodes qualitatives et quantitatives pour la détection d’information cachée. Ph.D. thesis, Université Pierre et Marie Curie (2011)
Bel Mokadem, H.: Verification des proprietes temporisees des automates programmables industriels. Ph.D. thesis, ECOLE NORMALE SUPERIEURE DE CACHAN (2007)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Jbeli, N., Sbaï, Z., Ayed, R.B. (2016). On Expressiveness of TCTL\(^{\varDelta }_{h}\) for Model Checking Distributed Systems. In: Nguyen, NT., Iliadis, L., Manolopoulos, Y., Trawiński, B. (eds) Computational Collective Intelligence. ICCCI 2016. Lecture Notes in Computer Science(), vol 9875. Springer, Cham. https://doi.org/10.1007/978-3-319-45243-2_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-45243-2_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45242-5
Online ISBN: 978-3-319-45243-2
eBook Packages: Computer ScienceComputer Science (R0)