Optimal strategies for testing nondeterministic systems
- 1 July 2004
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 29 (4) , 55-64
- https://doi.org/10.1145/1007512.1007520
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Runtime verification of .NET contractsJournal of Systems and Software, 2003
- Optimal transfer trees and distinguishing trees for testing observable nondeterministic finite-state machinesIEEE Transactions on Software Engineering, 2003
- Testing Transition Systems: An Annotated BibliographyPublished by Springer Nature ,2001
- A Heuristic for Dijkstra’s Algorithm with Many Targets and Its Use in Weighted Matching AlgorithmsPublished by Springer Nature ,2001
- An experiment in automatic generation of test suites for protocols with verification technologyScience of Computer Programming, 1997
- Principles and methods of testing finite state machines-a surveyProceedings of the IEEE, 1996
- The complexity of stochastic gamesInformation and Computation, 1992
- Formal methods for protocol testing: a detailed studyIEEE Transactions on Software Engineering, 1989
- Number of quantifiers is better than number of tape cellsJournal of Computer and System Sciences, 1981
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976