Abstract
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources of system complexity: concurrency, real time, and uncertainty. We advocate a two-step process: formal modeling followed by algorithmic analysis (or, “model building” followed by “model checking”). We model the concurrent components of a reactive system as potential collaborators or adversaries in a multi-player game with temporal objectives, such as system safety. The real-time aspect of embedded systems requires models that combine discrete state transitions and continuous state evolutions. Uncertainty in the environment is naturally modeled by probabilistic state changes. As a result, we obtain three orthogonal extensions of the basic state-transition graph model for reactive systems —game graphs, timed graphs, and stochastic graphs— as well as combinations thereof. In this short text, we provide a uniform exposition of the underlying definitions. For verification algorithms, we refer the reader to the literature.
This research was supported in part by the Swiss National Science Foundation, and by the NSF ITR grant CCR-0225610.
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., Courcoubetis, C., Dill, D.L.: Model Checking in Dense Real Time. Information and Computation 104, 2–34 (1993)
Alur, R., Dill, D.L.: A Theory of Timed Automata. Theoretical Computer Science 126, 183–235 (1994)
Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-Time Temporal Logic. Journal of the ACM 49, 672–713 (2002)
Chatterjee, K., de Alfaro, L., Henzinger, T.A.: The Complexity of Stochastic Rabin and Streett Games. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 878–890. Springer, Heidelberg (2005)
Chatterjee, K., de Alfaro, L., Henzinger, T.A.: The Complexity of Quantitative Concurrent Parity Games. In: Proceedings of the 17th Annual Symposium on Discrete Algorithms, USA, pp. 678–687. ACM Press, New York (2006)
Chatterjee, K., de Alfaro, L., Henzinger, T.A.: Strategy Improvement for Concurrent Reachability Games. In: Proceedings of the Third Annual Conference on Quantitative Evaluation of Systems, IEEE Computer Society Press, Los Alamitos (2006)
Chatterjee, K., Henzinger, T.A.: Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 512–523. Springer, Heidelberg (2006)
Chatterjee, K., Henzinger, T.A.: Strategy Improvement for Stochastic Rabin and Streett Games. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 375–389. Springer, Heidelberg (2006)
Chatterjee, K., Jurdziński, M., Henzinger, T.A.: Simple Stochastic Parity Games. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 100–113. Springer, Heidelberg (2003)
Chatterjee, K., Jurdziński, M., Henzinger, T.A.: Quantitative Stochastic Parity Games. In: Proceedings of the 15th Annual Symposium on Discrete Algorithms, USA, pp. 114–123. ACM Press, New York (2004)
Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)
Condon, A.: The Complexity of Stochastic Games. Information and Computation 96, 203–224 (1992)
Condon, A.: On Algorithms for Simple Stochastic Games. In: Advances in Computational Complexity Theory. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 13, pp. 51–73 (1993)
Courcoubetis, C., Yannakakis, M.: The Complexity of Probabilistic Verification. Journal of the ACM 42, 857–907 (1995)
de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD Thesis, Stanford University (1997)
de Alfaro, L., Faella, M., Henzinger, T.A., Majumdar, R., Stoelinga, M.: The Element of Surprise in Timed Games. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 144–158. Springer, Heidelberg (2003)
de Alfaro, L., Henzinger, T.A.: Concurrent Omega-Regular Games. In: Proceedings of the 15th Annual Symposium on Logic in Computer Science, pp. 141–154. IEEE Computer Society Press, Los Alamitos (2000)
de Alfaro, L., Henzinger, T.A., Kupferman, O.: Concurrent Reachability Games. In: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pp. 564–575. IEEE Computer Society Press, Los Alamitos (1998)
de Alfaro, L., Majumdar, R.: Quantitative Solution of Omega-Regular Games. Journal of Computer and System Sciences 68, 374–397 (2004)
Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, Heidelberg (1997)
Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)
Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic Model Checking for Real-Time Systems. Information and Computation 111, 193–244 (1994)
Henzinger, T.A., Prabhu, V.: Timed Alternating-Time Temporal Logic. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 1–17. Springer, Heidelberg (2006)
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)
Martin, D.A.: Borel Determinacy. Annals of Mathematics 102, 363–371 (1975)
Martin, D.A.: The Determinacy of Blackwell Games. The. Journal of Symbolic Logic 63, 1565–1581 (1998)
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)
Wong-Toi, H., Hoffmann, G.: The Control of Dense Real-Time Discrete Event Systems. In: Proceedings of the 30th Annual Conference on Decision and Control, pp. 1527–1528. IEEE Press, Piscataway (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Henzinger, T.A. (2007). Games, Time, and Probability: Graph Models for System Design and Analysis. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds) SOFSEM 2007: Theory and Practice of Computer Science. SOFSEM 2007. Lecture Notes in Computer Science, vol 4362. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69507-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-69507-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69506-6
Online ISBN: 978-3-540-69507-3
eBook Packages: Computer ScienceComputer Science (R0)