Complete model-based equivalence class testing for nondeterministic systems

DOI10.1007/S00165-016-0402-2zbMath1358.68043OpenAlexW2549482734MaRDI QIDQ520246

Wen-ling Huang, Jan Peleska

Publication date: 3 April 2017

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-016-0402-2

zbMATH Keywords

Kripke structuresnondeterminismrandom testingmodel-based testingcomplete testing theoriesequivalence class partition testing

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Exhaustive property oriented model-based testing with symbolic finite state machines

Uses Software

• SONOLAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Institution morphisms
• Testing for refinement in \textsf{Circus}
• Understanding concurrent systems
• Institution-independent model theory
• CSP and Kripke Structures
• Structured CSP – A Process Algebra as an Institution
• Testing Software Design Modeled by Finite-State Machines
• Institutions: abstract model theory for specification and programming
• Testing can be formal, too
• Formal Approaches to Software Testing
• Testing timed automata

This page was built for publication: Complete model-based equivalence class testing for nondeterministic systems