The complexity of asynchronous model based testing
DOI10.1016/J.TCS.2012.05.038zbMATH Open1251.68118OpenAlexW2161123813MaRDI QIDQ714798FDOQ714798
Authors: Robert M. Hierons
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.038
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Reliability, testing and fault tolerance of networks and computer systems (68M15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Depth-First Search and Linear Graph Algorithms
- The complexity of satisfiability problems
- The complexity of two-player games of incomplete information
- Testing Software Design Modeled by Finite-State Machines
- Title not available (Why is that?)
- Testing finite-state machines: state identification and verification
- Title not available (Why is that?)
- Adaptive Testing of a Deterministic Implementation Against a Nondeterministic Finite State Machine
- Applying adaptive test cases to nondeterministic implementations
- Trace and testing equivalence on asynchronous processes
- Title not available (Why is that?)
- A Fresh Look at Testing for Asynchronous Communication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reaching and Distinguishing States of Distributed Systems
Cited In (5)
Uses Software
This page was built for publication: The complexity of asynchronous model based testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714798)