Complete model-based equivalence class testing for nondeterministic systems

DOI10.1007/S00165-016-0402-2MaRDI QIDQ520246zbMATH OpenOpenAlexFDO

Authors 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

nondeterminismmodel-based testingcomplete testing theoriesequivalence class partition testingKripke structuresrandom testing

Mathematics Subject Classification ID

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

Recommendations

• Complete open-state testing of limitedly nondeterministic systems
• A Stochastic Theory of Black-Box Software Testing
• Testing nonlinear operators
• On conformance testing of non-deterministic systems
• scientific article; zbMATH DE number 1418458

Cites work

• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 2080058 (Why is no real title available?)
• scientific article; zbMATH DE number 3358370 (Why is no real title available?)
• scientific article; zbMATH DE number 3423954 (Why is no real title available?)
• CSP and Kripke Structures
• Formal Approaches to Software Testing
• Institution morphisms
• Institution-independent model theory
• Institutions: abstract model theory for specification and programming
• Structured CSP – A Process Algebra as an Institution
• Testing Software Design Modeled by Finite-State Machines
• Testing can be formal, too
• Testing for refinement in \textsf{Circus}
• Testing timed automata
• Understanding concurrent systems
• Unifying theories for logic programming

Cited in

(6)

• Using Model Counting to Find Optimal Distinguishing Tests
• Exhaustive property oriented model-based testing with symbolic finite state machines
• Partial models and weak equivalence
• Complete open-state testing of limitedly nondeterministic systems
• Coverage-based testing with symbolic transition systems
• An optimised complete strategy for testing symbolic finite state machines

Describes a project that uses

Uses Software

• SONOLAR

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)