State identification and verification with satisfaction

DOI10.1007/978-3-031-15629-8_23MaRDI QIDQ6108905zbMATH OpenOpenAlexFDO

Authors Joshua Moerman, Thorsten Wißmann

Publication date 26 July 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-15629-8_23

zbMATH Keywords

conformance testingfinite-state machinesMealy machinesSAT solvingstate identification

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational aspects of satisfiability (68R07)

Recommendations

• Exact DFA Identification Using SAT Solvers
• State identification, existence of sequences and machine classification
• Hardness and inapproximability of minimizing adaptive distinguishing sequences
• Testing finite state machines: Fault detection
• Hardness of deriving invertible sequences from finite state machines

Cites work

• Benchmarks for automata learning and conformance testing
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• Minimal separating sequences for all pairs of states
• PySAT: a Python toolkit for prototyping with SAT oracles
• Relating apartness and bisimulation
• Temporal induction by incremental SAT solving
• Testing finite-state machines: state identification and verification
• Theory and Applications of Satisfiability Testing
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints

This page was built for publication: State identification and verification with satisfaction

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