2020
DOI: 10.1007/978-3-030-57628-8_4
|View full text |Cite
|
Sign up to set email alerts
|

Certifying Emptiness of Timed Büchi Automata

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 35 publications
0
2
0
Order By: Relevance
“…The concept of certified model checking was conceived for the µ-calculus [86]. A proof of concept has been provided for SMT-based model checking [74] (where certificates are basically invariants) and more recently for liveness checking of finite-state systems [60] and timed automata [103] (where certificates consist of reachability invariants and topological ranking functions). In the latter case, the certifier was fully verified in the theorem prover Isabelle/HOL.…”
Section: Trustworthy and Certifiable Verificationmentioning
confidence: 99%
“…The concept of certified model checking was conceived for the µ-calculus [86]. A proof of concept has been provided for SMT-based model checking [74] (where certificates are basically invariants) and more recently for liveness checking of finite-state systems [60] and timed automata [103] (where certificates consist of reachability invariants and topological ranking functions). In the latter case, the certifier was fully verified in the theorem prover Isabelle/HOL.…”
Section: Trustworthy and Certifiable Verificationmentioning
confidence: 99%
“…Others leveraged SMT technology to increase their trustworthiness [12,14]. To the best of our knowledge, we present the first verified checker for an online monitor's output, even though verified certifiers are standard practice in other areas such as distributed systems [35], model checking [37,38], and SAT solving [11,21].…”
Section: Introductionmentioning
confidence: 99%