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

DOI10.1007/978-3-030-22348-9_24MaRDI QIDQ6165822zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• LTL Generalized Model Checking Revisited
• Satisfiability checking for mission-time \textsf{LTL} (MLTL)
• scientific article; zbMATH DE number 1487868
• \(\mathrm{LTL}_{f}\) satisfiability checking
• Model checking, synthesis, and learning
• Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall
• Testing Systems of Concurrent Black-Boxes—An Automata-Theoretic and Decompositional Approach

Cited in

(2)

• Exhaustive property oriented model-based testing with symbolic finite state machines
• An optimised complete strategy for testing 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

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