The complexity of asynchronous model based testing
From MaRDI portal
(Redirected from Publication:714798)
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)
Recommendations
Cites work
- scientific article; zbMATH DE number 5540316 (Why is no real title available?)
- scientific article; zbMATH DE number 1263212 (Why is no real title available?)
- scientific article; zbMATH DE number 2013781 (Why is no real title available?)
- scientific article; zbMATH DE number 1418452 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- A Fresh Look at Testing for Asynchronous Communication
- Adaptive Testing of a Deterministic Implementation Against a Nondeterministic Finite State Machine
- Applying adaptive test cases to nondeterministic implementations
- Depth-First Search and Linear Graph Algorithms
- Reaching and Distinguishing States of Distributed Systems
- Testing Software Design Modeled by Finite-State Machines
- Testing finite-state machines: state identification and verification
- The complexity of satisfiability problems
- The complexity of two-player games of incomplete information
- Trace and testing equivalence on asynchronous processes
Cited in
(5)- Passive testing with asynchronous communications and timestamps
- Generation of complete test suites from Mealy input/output transition systems
- Synchronizing asynchronous conformance testing
- Introducing complexity to formal testing
- scientific article; zbMATH DE number 1418463 (Why is no real title available?)
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)