Automated repair for timed systems
From MaRDI portal
Publication:6108434
DOI10.1007/s10703-022-00397-5zbMath1522.68366OpenAlexW4302027599MaRDI QIDQ6108434
Martin Kölbl, Stefan Leue, Thomas Wies
Publication date: 29 June 2023
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-022-00397-5
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decision procedures. An algorithmic point of view
- A unified approach for showing language inclusion and equivalence between various types of \(\omega\)-automata
- Model-checking in dense real-time
- A new polynomial-time algorithm for linear programming
- Recognizing safety and liveness
- Real quantifier elimination is doubly exponential
- A calculus of communicating systems
- A theory of timed automata
- Symbolic model checking for real-time systems
- Kronos: A verification tool for real-time systems
- Timed automata relaxation for reachability
- An automated system repair framework with signal temporal logic
- Refutation-based synthesis in SMT
- Diagnosis and Repair for Synthesis from Signal Temporal Logic Specifications
- Model Checking Real-Time Systems
- Automatic Abstraction Refinement for Timed Automata
- Lectures on Concurrency and Petri Nets
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: Automated repair for timed systems
