DeepAI AI Chat
Log In Sign Up

Certifying Emptiness of Timed Büchi Automata

by   Simon Wimmer, et al.
Technische Universität München

Model checkers for timed automata are widely used to verify safety-critical, real-time systems. State-of-the-art tools achieve scalability by intricate abstractions. We aim at further increasing the trust in their verification results, in particular for checking liveness properties. To this end, we develop an approach for extracting certificates for the emptiness of timed Büchi automata from model checking runs. These certificates can be double-checked by a certifier that we formally verify in Isabelle/HOL. We study liveness certificates in an abstract setting and show that our approach is sound and complete. To also demonstrate its feasibility, we extract certificates for several models checked by TChecker and Imitator, and validate them with our verified certifier.


page 1

page 2

page 3

page 4


Parikh Automata over Infinite Words

Parikh automata extend finite automata by counters that can be tested fo...

A case study on parametric verification of failure detectors

Partial synchrony is a model of computation in many distributed algorith...

Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties

Probabilistic timed automata (PTAs) are timed automata (TAs) extended wi...

Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction

We address the safety verification and synthesis problems for real-time ...

Active Learning of Abstract System Models from Traces using Model Checking [Extended]

We present a new active model-learning approach to generating abstractio...

An Experiment in Ping-Pong Protocol Verification by Nondeterministic Pushdown Automata

An experiment is described that confirms the security of a well-studied ...

Modular Safety Verification for Stateful Networks

Modern networks achieve robustness and scalability by maintaining states...