Enhancing active model learning with equivalence checking using simulation relations

DOI10.1007/s10703-023-00433-yOpenAlexW4385611645MaRDI QIDQ6151756

Natasha Yogananda Jeppu, Daniel Kroening, Tom Melham

Publication date: 11 March 2024

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-023-00433-y

zbMATH Keywords

model checkingequivalence checkingsimulation relationexecution tracessystem abstractionactive model learning

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Active learning for extended finite state machines
• Deterministic finite automata with recursive calls and DPDAs
• Learning regular sets from queries and counterexamples
• Tools and algorithms for the construction and analysis of systems. 8th international conference, TACAS 2002. Held as part of the joint European conferences on theory and practice of software, ETAPS 2002, Grenoble, France, April 8--12, 2002
• Combining black-box and white-box techniques for learning register automata
• Learning Mealy machines with one timer
• Sigma*
• Automata Learning with Automated Alphabet Abstraction Refinement
• Learning Regular Languages over Large Ordered Alphabets
• Exact DFA Identification Using SAT Solvers
• Symbolic execution and program testing
• Automata Learning through Counterexample Guided Abstraction Refinement
• Learning the Language of Software Errors
• On the Synthesis of Finite-State Machines from Samples of Their Behavior
• The learnability of symbolic automata

This page was built for publication: Enhancing active model learning with equivalence checking using simulation relations