Abstract
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until almost everywhere”. In the extended logic, it is possible, for instance, to express that a property is true at all positions of all runs, except on a negligible set of positions. Such properties are very convenient, for example in the framework of boolean program verification, where transitions result from changing variable values. We investigate the expressive power of this modality and in particular, we prove that it cannot be expressed with classical TCTL modalities. However, we show that model-checking the extended logic remains PSPACE-complete as for TCTL.
Work partially supported by the project VSMT of ENS de Cachan.
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
Preview
Unable to display preview. Download preview PDF.
References
Aceto, L., Bouyer, P., Burgueño, A., Larsen, K.G.: The power of reachability testing for timed automata. Theoretical Computer Science 300(1-3), 411–475 (2003)
Alur, R., Courcoubetis, C., Dill, D.: Model-checking in dense real-time. Information and Computation 104(1), 2–34 (1993)
Alur, R., Dill, D.: Automata for modeling real-time systems. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 322–335. Springer, Heidelberg (1990)
Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)
Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. Journal of the ACM 43(1), 116–146 (1996)
Alur, R., Henzinger, T.A.: Logics and models of real-time: a survey. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1992. LNCS, vol. 666, pp. 74–106. Springer, Heidelberg (1993)
Bel Mokadem, H., Bérard, B., Bouyer, P., Laroussinie, F.: A new modality for almost everywhere properties in timed automata. Research Report LSV-05-06, LSV, ENS de Cachan, France (2005)
Bérard, B., Fribourg, L., Klay, F., Monin, J.-F.: A compared study of two correctness proofs for the standardized algorithm of abr conformance. Formal Methods in System Design 22(1), 59–86 (2003)
Daws, C., Olivero, A., Tripakis, S., Yovine, S.: The tool kronos. In: Alur, R., Sontag, E.D., Henzinger, T.A. (eds.) HS 1995. LNCS, vol. 1066, pp. 208–219. Springer, Heidelberg (1996)
Emerson, E.A., Halpern, J.Y.: “Sometimes” and “not never” revisited: On branching versus linear time temporal logic. Journal of the ACM 33(1), 151–178 (1986)
Emerson, E.A.: Temporal and Modal Logic. (Formal Models and Semantics) Handbook of Theoretical Computer Science, vol. B, pp. 995–1072. MIT Press, Cambridge (1991)
Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: HyTech: the next generation. In: Proc. 16th IEEE Real-Time Systems Symposium (RTSS 1995), pp. 56–65. IEEE Computer Society Press, Los Alamitos (1995)
Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model-checking for real-time systems. Information and Computation 111(2), 193–244 (1994)
IEC (International Electrotechnical Commission). IEC Standard 61131-3: Programmable controllers - Part 3 (1993)
Laroussinie, F., Larsen, K.G., Weise, C.: From timed automata to logic – and back. In: Hájek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol. 969, pp. 529–539. Springer, Heidelberg (1995)
Larsen, K.G., Pettersson, P., Yi, W.: Uppaal in a nutshell. Journal of Software Tools for Technology Transfer 1(1-2), 134–152 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mokadem, H.B., Bérard, B., Bouyer, P., Laroussinie, F. (2005). A New Modality for Almost Everywhere Properties in Timed Automata. In: Abadi, M., de Alfaro, L. (eds) CONCUR 2005 – Concurrency Theory. CONCUR 2005. Lecture Notes in Computer Science, vol 3653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539452_12
Download citation
DOI: https://doi.org/10.1007/11539452_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28309-6
Online ISBN: 978-3-540-31934-4
eBook Packages: Computer ScienceComputer Science (R0)