Complete FSM testing using strong separability

DOI10.1007/978-3-032-22730-0_16MaRDI QIDQ7317491zbMATH OpenFDO

Authors Robert M. Hierons, Mohammad Mousavi

Publication date 24 August 2026

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-032-22730-0_16

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• \(L^\ast\)-based learning of Markov decision processes (extended version)
• A new approach for active automata learning based on apartness
• Automata, Languages and Programming
• Bisimulation for labelled Markov processes
• Conformance relations and hyperproperties for doping detection in time and space
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• scientific article; zbMATH DE number 1754609 (Why is no real title available?)
• Learning regular sets from queries and counterexamples
• Logics and type systems in theory and practice. Essays dedicated to Herman Geuvers on the occasion of his 60th birthday
• Model-based testing of reactive systems. Advanced lectures.
• Notions of conformance testing for cyber-physical systems: overview and roadmap (invited paper)
• Principles of verification: cycling the probabilistic landscape. Essays dedicated to Joost-Pieter Katoen on the occasion of his 60th birthday. Part III
• Quantifying conformance using the Skorokhod metric
• Robustness of temporal logic specifications for continuous-time signals
• Testing can be formal, too
• Testing finite-state machines: state identification and verification
• Testing Software Design Modeled by Finite-State Machines

This page was built for publication: Complete FSM testing using strong separability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7317491)