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

    Figures and Tables from this paper

    References

    SHOWING 1-10 OF 26 REFERENCES
    Parametric real-time reasoning
    • 385
    • PDF
    Symbolic Model Checking for Real-Time Systems
    • 834
    • PDF
    History Preserving Bisimulation for Contextual Nets
    • 7
    • PDF
    On Decidability of Prebisimulation for Timed Automata
    • 9
    • PDF
    Efficient Scaling-Invariant Checking of Timed Bisimulation
    • 53
    • Highly Influential
    A survey of timed automata for the development of real-time systems
    • 44
    • Highly Influential
    A Unifying Approach to Decide Relations for Timed Automata and their Game Characterization
    • 3
    • PDF
    Characterization of the Expressive Power of Silent Transitions in Timed Automata
    • 166