Log In Sign Up

Checking Timed Bisimulation with Bounded Zone-History Graphs – Technical Report

by   Lars Luthmann, et al.

Timed automata (TA) are a well-established formalism for discrete-state/continuous-time behaviors of time-critical reactive systems. Concerning the fundamental analysis problem of comparing a candidate implementation against a specification, both given as TA, it has been shown that timed trace equivalence is undecidable, whereas timed bisimulation equivalence is decidable. The corresponding proof utilizes region graphs, a finite, but very space-consuming characterization of TA semantics. In practice, most TA tools use zone graphs instead, a symbolic and generally more efficient representation of TA semantics, to automate analysis tasks. However, zone graphs only produce sound results for analysis tasks being reducible to plain reachability problems thus being too imprecise for checking timed bisimilarity. Hence, to the best of our knowledge, no practical tool is currently available for automated timed bisimilarity-checking. In this paper, we propose bounded zone-history graphs, a novel characterization of TA semantics facilitating an adjustable trade-off between precision and scalability of timed-bisimilarity checking. Our tool TimBrCheck supports deterministic timed automata. We further present experimental results gained from applying our tool to a collection of community benchmarks, providing insights into trade-offs between precision and efficiency.


page 1

page 2

page 3

page 4


Convex Language Semantics for Nondeterministic Probabilistic Automata

We explore language semantics for automata combining probabilistic and n...

A Game Characterization for Contrasimilarity

We present the first game characterization of contrasimilarity, the weak...

Timed Automata Robustness Analysis via Model Checking

Timed automata (TA) have been widely adopted as a suitable formalism to ...

Bounded Invariant Checking for Stateflow

Stateflow models are complex software models, often used as part of indu...

Complementing Büchi Automata with Ranker (Technical Report)

We present the tool Ranker for complementing Büchi automata (BAs). Ranke...

A Type System for Privacy Properties (Technical Report)

Mature push button tools have emerged for checking trace properties (e.g...