Certifying emptiness of timed Büchi automata
From MaRDI portal
Publication:1996011
DOI10.1007/978-3-030-57628-8_4OpenAlexW3082487236MaRDI QIDQ1996011
Frédéric Herbreteau, Simon Wimmer, Jaco van de Pol
Publication date: 2 March 2021
Full work available at URL: https://arxiv.org/abs/2007.04150
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Better abstractions for timed automata
- Formal verification of an executable LTL model checker with partial order reduction
- Checking timed Büchi automata emptiness efficiently
- A theory of timed automata
- Isabelle/HOL. A proof assistant for higher-order logic
- A verified SAT solver framework with learn, forget, restart, and incrementality
- Efficient, verified checking of propositional proofs
- Uppaal in a nutshell
- Certifying emptiness of timed Büchi automata
- Verified model checking of timed automata
- Checking timed Büchi automata emptiness on simulation graphs
- Synthesis of Timing Parameters Satisfying Safety Properties
- Checking Timed Büchi Automata Emptiness Using LU-Abstractions
- Why Liveness for Timed Automata Is Hard, and What We Can Do About It
- Automated Verification of Parallel Nested DFS
- Verified Certification of Reachability Checking for Timed Automata
- Lectures on Concurrency and Petri Nets
- Efficient verified (UN)SAT certificate checking
- Well-structured transition systems everywhere!
This page was built for publication: Certifying emptiness of timed Büchi automata
