Timed automata verification and synthesis via finite automata learning
From MaRDI portal
Publication:6536137
DOI10.1007/978-3-031-30820-8_21zbMath1547.68453MaRDI QIDQ6536137
Publication date: 5 April 2024
Computational learning theory (68Q32) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces
- Learning register automata: from languages to program structures
- Learning of event-recording automata
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Solving games via three-valued abstraction refinement
- Learning regular sets from queries and counterexamples
- A theory of timed automata
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- Zone-based verification of timed automata: extrapolations, simulations and what next?
- SMT-based satisfiability of first-order LTL with event freezing functions and metric operators
- Infinite-state invariant checking with IC3 and predicate abstraction
- Inference of finite automata using homing sequences
- Learning Regular Languages over Large Ordered Alphabets
- An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP
- Refinement of Trace Abstraction
- Counterexample-guided abstraction refinement for symbolic model checking
- Trace Abstraction Refinement for Timed Automata
- Handbook of Model Checking
- On the synthesis of strategies in infinite games
- On the synthesis of discrete controllers for timed systems
- Improved BDD-Based Discrete Analysis of Timed Systems
- SMT-Based Induction Methods for Timed Systems
- Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction*
- Learning-Based Compositional Parameter Synthesis for Event-Recording Automata
- A Generic Algorithm for Learning Symbolic Automata from Membership Queries
- Tools and Algorithms for the Construction and Analysis of Systems
- Assume-Admissible Synthesis
- CONCUR 2005 – Concurrency Theory
- Computer Aided Verification
- Abstraction refinement algorithms for timed automata
Related Items (1)
This page was built for publication: Timed automata verification and synthesis via finite automata learning
