Distinguishing tests for nondeterministic and probabilistic machines
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Evolving algebras 1993: Lipari guide
Specification and validation methods
Competitive Markov decision processes
Competitive Markov decision processes
Testing deterministic implementations from nondeterministic FSM specifications
Selected proceedings of the IFIP TC6 9th international workshop on Testing of communicating systems
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Generating finite state machines from abstract state machines
ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Testing Probabilistic and Nondeterministic Processes
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Computing Minimum and Maximum Reachability Times in Probabilistic Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Testing Non-Deterministic State Machines with Fault Coverage
Proceedings of the IFIP TC6/WG6.1 Fourth International Workshop on Protocol Test Systems IV
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Optimal strategies for testing nondeterministic systems
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Testing, Optimizaton, and Games
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Online testing with model programs
Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
Theoretical Computer Science - Formal methods for components and objects
Runtime Refinement Checking of Concurrent Data Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Experiments with test case generation and runtime analysis
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
The spec# programming system: an overview
CASSIS'04 Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices
Cooperative Testing of Timed Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
Information and Computation
Model-based testing of object-oriented reactive systems with spec explorer
Formal methods and testing
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
A survey of stochastic ω-regular games
Journal of Computer and System Sciences
Testing real-time systems under uncertainty
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
Testing tasks can be viewed (and organized!) as games against nature. We study reachability games in the context of testing. Such games are ubiquitous. A single industrial test suite may involve many instances of a reachability game. Hence the importance of optimal or near optimal strategies for reachability games. One can use linear programming or the value iteration method of Markov decision process theory to find optimal strategies. Both methods have been implemented in an industrial model-based testing tool, Spec Explorer, developed at Microsoft Research.