Complete model-based equivalence class testing for nondeterministic systems
From MaRDI portal
Publication:520246
DOI10.1007/S00165-016-0402-2zbMATH Open1358.68043OpenAlexW2549482734MaRDI QIDQ520246FDOQ520246
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
Recommendations
nondeterminismmodel-based testingcomplete testing theoriesequivalence class partition testingKripke structuresrandom testing
Cites Work
- Institution-independent model theory
- Institutions: abstract model theory for specification and programming
- Testing Software Design Modeled by Finite-State Machines
- Testing can be formal, too
- Unifying theories for logic programming
- Title not available (Why is that?)
- Understanding concurrent systems
- Institution morphisms
- Title not available (Why is that?)
- Testing timed automata
- Formal Approaches to Software Testing
- Testing for refinement in \textsf{Circus}
- CSP and Kripke Structures
- Structured CSP – A Process Algebra as an Institution
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
Uses Software
This page was built for publication: Complete model-based equivalence class testing for nondeterministic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q520246)