Synchronous or alternating? LTL black-box checking of Mealy machines by combining the LearnLib and LTSmin

DOI10.1007/978-3-030-22348-9_24zbMath1519.68124OpenAlexW2956147405MaRDI QIDQ6165822

Jaco van de Pol, Jeroen Meijer

Publication date: 2 August 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-030-22348-9_24

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (1)

Exhaustive property oriented model-based testing with symbolic finite state machines

This page was built for publication: Synchronous or alternating? LTL black-box checking of Mealy machines by combining the LearnLib and LTSmin