State identification and verification with satisfaction

DOI10.1007/978-3-031-15629-8_23zbMath1524.68176OpenAlexW4297922712MaRDI QIDQ6108905

Thorsten Wißmann, Joshua Moerman

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

finite-state machinesstate identificationSAT solvingconformance testingMealy machines

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• PySAT: a Python toolkit for prototyping with SAT oracles
• Minimal Separating Sequences for All Pairs of States
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Theory and Applications of Satisfiability Testing
• Testing finite-state machines: state identification and verification
• Benchmarks for automata learning and conformance testing

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