[{"conference":{"name":"SOFSEM: Current Trends in Theory and Practice of Computer Science"},"volume":4362,"extern":1,"alternative_title":["LNCS"],"intvolume":"      4362","fulldoi":"https://doi.org/10.1007/978-3-540-69507-3_7","date_created":"2018-12-11T12:09:15Z","_id":"4514","publist_id":"217","publication_status":"published","acknowledgement":"This research was supported in part by the Swiss National Science Foundation, and by the NSF ITR grant CCR-0225610.","date_updated":"2021-01-12T07:59:22Z","citation":{"short":"T.A. Henzinger, in:, Springer, 2007, pp. 103–110.","apa":"Henzinger, T. A. (2007). Games, time, and probability: Graph models for system design and analysis (Vol. 4362, pp. 103–110). Presented at the SOFSEM: Current Trends in Theory and Practice of Computer Science, Springer. <a href=\"https://doi.org/10.1007/978-3-540-69507-3_7\">https://doi.org/10.1007/978-3-540-69507-3_7</a>","ama":"Henzinger TA. Games, time, and probability: Graph models for system design and analysis. In: Vol 4362. Springer; 2007:103-110. doi:<a href=\"https://doi.org/10.1007/978-3-540-69507-3_7\">10.1007/978-3-540-69507-3_7</a>","ieee":"T. A. Henzinger, “Games, time, and probability: Graph models for system design and analysis,” presented at the SOFSEM: Current Trends in Theory and Practice of Computer Science, 2007, vol. 4362, pp. 103–110.","mla":"Henzinger, Thomas A. <i>Games, Time, and Probability: Graph Models for System Design and Analysis</i>. Vol. 4362, Springer, 2007, pp. 103–10, doi:<a href=\"https://doi.org/10.1007/978-3-540-69507-3_7\">10.1007/978-3-540-69507-3_7</a>.","chicago":"Henzinger, Thomas A. “Games, Time, and Probability: Graph Models for System Design and Analysis,” 4362:103–10. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-69507-3_7\">https://doi.org/10.1007/978-3-540-69507-3_7</a>.","ista":"Henzinger TA. 2007. Games, time, and probability: Graph models for system design and analysis. SOFSEM: Current Trends in Theory and Practice of Computer Science, LNCS, vol. 4362, 103–110."},"year":"2007","publisher":"Springer","type":"conference","author":[{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":0,"page":"103 - 110","day":"04","date_published":"2007-01-04T00:00:00Z","status":"public","doi":"10.1007/978-3-540-69507-3_7","title":"Games, time, and probability: Graph models for system design and analysis","abstract":[{"text":"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.","lang":"eng"}],"month":"01"}]