Learning assumptions for compositional verification of timed automata
From MaRDI portal
Publication:6535626
DOI10.1007/978-3-031-37706-8_3zbMath1547.68417MaRDI QIDQ6535626
Hanyue Chen, Yu Su, Zhi-Ming Liu, Miaomiao Zhang, Junri Mi
Publication date: 1 February 2024
Computational learning theory (68Q32) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Three optimizations for assume-guarantee reasoning with \(L^{*}\)
- Learning regular sets from queries and counterexamples
- Event-clock automata: a determinizable class of timed automata
- A theory of timed automata
- An Efficient Algorithm for Learning Event-Recording Automata
- Automated Assume-Guarantee Reasoning by Abstraction Refinement
- Graph-Based Algorithms for Boolean Function Manipulation
- Learning One-Clock Timed Automata
- SAT-Based Compositional Verification Using Lazy Learning
- Formal Methods for the Design of Real-Time Systems
- Computer Aided Verification
- Refining Interface Alphabets for Compositional Verification
- Optimized L*-Based Assume-Guarantee Reasoning
- Verifying abstractions of timed systems
- Timed automata verification and synthesis via finite automata learning
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Learning assumptions for compositional verification of timed automata
