Learning deterministic one-clock timed automata via mutation testing

DOI10.1007/978-3-031-19992-9_15zbMath1522.68286OpenAlexW4312304454MaRDI QIDQ6160914

Bohua Zhan, Wei Shen, Naijun Zhan, Xiaochen Tang, Miaomiao Zhang, Jie An

Publication date: 2 June 2023

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-19992-9_15

zbMATH Keywords

timed automataactive learningmodel-based mutation testing

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Improving active Mealy machine learning for protocol conformance testing
• Learning of event-recording automata
• Conformance testing for real-time systems
• Learning regular sets from queries and counterexamples
• A theory of timed automata
• Active learning of timed automata with unobservable resets
• Combining black-box and white-box techniques for learning register automata
• Learning Mealy machines with one timer
• Efficient active automata learning via mutation testing
• Syntax and consistent equation semantics of hybrid Chi
• Testing Software Design Modeled by Finite-State Machines
• Learning One-Clock Timed Automata
• Fundamental Approaches to Software Engineering