Corpus ID: 204800364

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

@article{Luthmann2019CheckingTB,
  title={Checking Timed Bisimulation with Bounded Zone-History Graphs - Technical Report},
  author={Lars Luthmann and Hendrik G{\"o}ttmann and Malte Lochau},
  journal={ArXiv},
  year={2019},
  volume={abs/1910.08992}
}

Lars Luthmann, Hendrik Göttmann, Malte Lochau

Published 2019

Computer Science

ArXiv

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… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed