Concurrent reachability games
- 27 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 39, 564-575
- https://doi.org/10.1109/sfcs.1998.743507
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Design and synthesis of synchronization skeletons using branching time temporal logicPublished by Springer Nature ,2005
- A linear-time model-checking algorithm for the alternation-free modal mu-calculusPublished by Springer Nature ,1992
- An Analysis of Stochastic Shortest Path ProblemsMathematics of Operations Research, 1991
- Verifying temporal properties of finite-state probabilistic programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Termination of Probabilistic Concurrent ProgramACM Transactions on Programming Languages and Systems, 1983
- A finite algorithm for the switching control stochastic gameOR Spectrum, 1983
- Existence of Value and Randomized Strategies in Zero-Sum Discrete-Time Stochastic Dynamic GamesSIAM Journal on Control and Optimization, 1981
- Number of quantifiers is better than number of tape cellsJournal of Computer and System Sciences, 1981
- On the menbership problem for functional and multivalued dependencies in relational databasesACM Transactions on Database Systems, 1980
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975