Abstract
An open system can be modeled as a two-player game between the system and its environment. At each round, player 1 (the system) and player 2 (the environment) independently and simultaneously choose moves, and the two choices determine the next state of the game. Properties of open systems can be modeled as objectives of these two-player games. For the basic objective, there are three types of winning states, according to the degree of certainty with which player 1 can reach the target. For finite state spaces, it is shown that all three sets of winning states can be computed in polynomial time: type-1 states in linear time, and type-2 and type-3 states in quadratic time.
| Original language | English |
|---|---|
| Pages (from-to) | 564-575 |
| Number of pages | 12 |
| Journal | Annual Symposium on Foundations of Computer Science - Proceedings |
| State | Published - 1998 |
| Externally published | Yes |
| Event | Proceedings of the 1998 39th Annual Symposium on Foundations of Computer Science - Palo Alto, CA, USA Duration: 8 Nov 1998 → 11 Nov 1998 |
Bibliographical note
Funding Information:We thank Rajeev Alur, Krishnendu Chatterjee, Jerzy Filar, Christos Papadimitriou, T.E.S. Raghavan, Valter Sorana, and Mihalis Yannakakis for helpful discussions and pointers to the literature. We thank the U.S. National Science Foundation and the Swiss National Science Foundation for supporting this research. We also thank the Army Research Office, the Defense Advanced Research Projects Agency, the Office of Naval Research, and the Semiconductor Research Corporation for supporting the original conference publication of this work.