Abstract
One clock alternating timed automata (OCATA) have been introduced as natural extension of (one clock) timed automata to express the semantics of MTL [15]. In this paper, we consider the application of OCATA to the problems of model-checking and satisfiability for MITL (a syntactic fragment of MTL), interpreted over infinite words. Our approach is based on the interval semantics (recently introduced in [5] in the case of finite words) extended to infinite words. We propose region-based and zone-based algorithms, based on this semantics, for MITL model-checking and satisfiability. We report on the performance of a prototype tool implementing those algorithms.
The research leading to these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013) under Grant Agreement n°601148 (CASSTING).
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
Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)
Abdulla, P.A., Deneux, J., Ouaknine, J., Quaas, K., Worrell, J.: Universality Analysis for One-Clock Timed Automata. Fundam. Inform. 89(4), 419–450 (2008)
Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. J. ACM 43(1), 116–146 (1996)
Bouyer, P.: Timed Automata may cause some troubles. Research Report LSV-02-9, Lab. Spécification et Vérification, CNRS & ENS de Cachan, France (2002)
Brihaye, T., Estiévenart, M., Geeraerts, G.: On MITL and Alternating Timed Automata. In: Braberman, V., Fribourg, L. (eds.) FORMATS 2013. LNCS, vol. 8053, pp. 47–61. Springer, Heidelberg (2013)
Brihaye, T., Estiévenart, M., Geeraerts, G.: On MITL and Alternating Timed Automata over infinite words. Technical report arXiv.org., http://arxiv.org/abs/1406.4395
Clarke, E.M., Grumberg, O., Peled, D.: Model checking. MIT Press (2001)
Daws, C., Yovine, S.: Reducing the number of clock variables of timed automata. Real-Time Systems, 73–81 (1996)
Geeraerts, G., Kalyon, G., Le Gall, T., Maquet, N., Raskin, J.-F.: Lattice-Valued Binary Decision Diagrams. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol. 6252, pp. 158–172. Springer, Heidelberg (2010)
Gastin, P., Oddoux, D.: Fast LTL to Büchi Automata Translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53–65. Springer, Heidelberg (2001)
Koymans, R.: Specifying real-time properties with metric temporal logic. Real-Time Systems 2(4), 255–299 (1990)
Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. ACM Trans. Comput. Log. 2(3), 408–429 (2001)
Maquet, N.: New Algorithms and Data Structures for the Emptiness Problem of Alternating Automata. PhD thesis, Université Libre de Bruxelles (2011)
Miyano, S., Hayashi, T.: Alternating Finite Automata on omega-Words. Theor. Comput. Sci. 32, 321–330 (1984)
Ouaknine, J., Worrell, J.: On the decidability of metric temporal logic. In: LICS 2005, pp. 188–197. IEEE (2005)
Ouaknine, J., Worrell, J.: On the decidability and complexity of metric temporal logic over finite words. Logical Methods in Computer Science 3(1) (2007)
Parys, P., Walukiewicz, I.: Weak Alternating Timed Automata. Logical Methods in Computer Science 8(3) (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Brihaye, T., Estiévenart, M., Geeraerts, G. (2014). On MITL and Alternating Timed Automata over Infinite Words. In: Legay, A., Bozga, M. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2014. Lecture Notes in Computer Science, vol 8711. Springer, Cham. https://doi.org/10.1007/978-3-319-10512-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-10512-3_6
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10511-6
Online ISBN: 978-3-319-10512-3
eBook Packages: Computer ScienceComputer Science (R0)