Abstract
In this paper, we propose the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties
The algorithm we propose is a symbolic extension of the on-the-fly algorithm suggested by Liu & Smolka [15] for linear-time model-checking of finite-state systems. Being on-the-fly, the symbolic algorithm may terminate long before having explored the entire state-space. Also the individual steps of the algorithm are carried out efficiently by the use of so-called zones as the underlying data structure.
Various optimizations of the basic symbolic algorithm are proposed as well as methods for obtaining time-optimal winning strategies (for reachability games). Extensive evaluation of an experimental implementation of the algorithm yields very encouraging performance results.
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
Altisen, K., Tripakis, S.: Tools for controller synthesis of timed systems. In: Proc. 2nd Work. on Real-Time Tools (RT-TOOLS 2002), Proc. published as Technical Report 2002-025, Uppsala University, Sweden (2002)
Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)
Alur, R., La Torre, S., Pappas, G.J.: Optimal Paths in Weighted Timed Automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 49–62. Springer, Heidelberg (2001)
Andersen, H.R.: Model Checking and Boolean Graphs. Theoretical Computer Science 126(1), 3–30 (1994)
Asarin, E., Maler, O.: As Soon as Possible: Time Optimal Control for Timed Automata. In: Vaandrager, F.W., van Schuppen, J.H. (eds.) HSCC 1999. LNCS, vol. 1569, pp. 19–30. Springer, Heidelberg (1999)
Asarin, E., Maler, O., Pnueli, A., Sifakis, J.: Controller Synthesis for Timed Automata. In: Proc. IFAC Symp. on System Structure & Control, pp. 469–474. Elsevier Science, Amsterdam (1998)
Behrmann, G.: Distributed reachability analysis in timed automata. Journal of Software Tools for Technology Transfer (STTT) 7(1), 19–30 (2005)
Bozga, M., Daws, C., Maler, O., Olivero, A., Tripakis, S., Yovine, S.: Kronos: a Model-Checking Tool for Real-Time Systems. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 546–550. Springer, Heidelberg (1998)
De Alfaro, L., Henzinger, T.A., Majumdar, R.: Symbolic algorithms for infinite-state games. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 536–550. Springer, Heidelberg (2001)
Holzmann, G.J.: The SPIN Model Checker. Addison-Wesley, Reading (2003)
La Torre, S., Mukhopadhyay, S., Murano, A.: Optimal-Reachability and Control for Acyclic Weighted Timed Automata. In: Proc. 2nd IFIP Conf. on Theoretical Computer Science (TCS 2002), vol. 223, pp. 485–497. Kluwer, Norwell (2002)
Larsen, K.G.: Efficient Local Correctness Checking. In: Proc. of Conf. of Computer Assisted Verification (CAV 1992). LNCS, vol. 663, pp. 30–43. Springer, Heidelberg (1992)
Larsen, K.G., Pettersson, P., Yi, W.: Uppaal in a Nutshell. Journal of Software Tools for Technology Transfer (STTT) 1(1-2), 134–152 (1997)
Lewerentz, C., Lindner, T.: Production Cell: A Comparative Study in Formal Specification and Verification. In: Jähnichen, S., Broy, M. (eds.) KORSO 1995. LNCS, vol. 1009, pp. 388–416. Springer, Heidelberg (1995)
Liu, X., Smolka, S.: Simple Linear-Time Algorithm for Minimal Fixed Points. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 53–66. Springer, Heidelberg (1998)
Maler, O., Pnueli, A., Sifakis, J.: On the synthesis of discrete controllers for timed systems. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 229–242. Springer, Heidelberg (1995)
Melcher, H., Winkelmann, K.: Controller Synthesis for the “Production Cell” Case Study. In: Proc. of 2nd Work. on Formal Methods in Software Practice, pp. 24–36. ACM Press, New York (1998)
Rasmussen, J., Larsen, K.G., Subramani, K.: Resource-optimal scheduling using priced timed automata. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 220–235. Springer, Heidelberg (2004)
Thomas, W.: On the Synthesis of Strategies in Infinite Games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 1–13. Springer, Heidelberg (1995) (invited talk)
Tripakis, S., Altisen, K.: On-the-Fly Controller Synthesis for Discrete and Timed Systems. In: Wing, J.M., Woodcock, J.C.P., Davies, J. (eds.) FM 1999. LNCS, vol. 1708, pp. 233–252. Springer, Heidelberg (1999)
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
Cassez, F., David, A., Fleury, E., Larsen, K.G., Lime, D. (2005). Efficient On-the-Fly Algorithms for the Analysis of Timed Games. 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_9
Download citation
DOI: https://doi.org/10.1007/11539452_9
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)