The complexity of asynchronous model based testing

DOI10.1016/j.tcs.2012.05.038zbMath1251.68118OpenAlexW2161123813MaRDI QIDQ714798

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

zbMATH Keywords

software testingasynchronous channelsinput output transition systemmodel based testing

Mathematics Subject Classification ID

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)

Related Items

Generation of complete test suites from Mealy input/output transition systems, Passive testing with asynchronous communications and timestamps, Introducing complexity to formal testing

Uses Software

• AsmL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of two-player games of incomplete information
• Applying adaptive test cases to nondeterministic implementations
• Trace and testing equivalence on asynchronous processes
• A Fresh Look at Testing for Asynchronous Communication
• Testing Software Design Modeled by Finite-State Machines
• Adaptive Testing of a Deterministic Implementation Against a Nondeterministic Finite State Machine
• Testing finite-state machines: state identification and verification
• Reaching and Distinguishing States of Distributed Systems
• The complexity of satisfiability problems
• Depth-First Search and Linear Graph Algorithms