Download PDFOpen PDF in browser

Unifying Equivalences for Timed Transition Systems

19 pagesPublished: June 22, 2012


Timed transition systems are a widely studied model for real-time systems.
The intention of the paper is to show how several categorical (open maps, path-bisimilarity and coalgebraic) approaches to an abstract characterization of
bisimulation relate to each other and to the numerous suggested behavioral equivalences of linear time -- branching time spectrum, in the setting of timed transition systems.

Keyphrases: behavioral equivalences, Coalgebraic Bisimulation, Open Maps Bisimulation, Path Bisimulation, timed transition system

In: Andrei Voronkov (editor). Turing-100. The Alan Turing Centenary, vol 10, pages 386--404

BibTeX entry
  author    = {Irina Virbitskaite and Natalya Gribovskaya and Eike Best},
  title     = {Unifying Equivalences for Timed Transition Systems},
  booktitle = {Turing-100. The Alan Turing Centenary},
  editor    = {Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {10},
  pages     = {386--404},
  year      = {2012},
  publisher = {EasyChair},
  bibsource = {EasyChair,},
  issn      = {2398-7340},
  url       = {},
  doi       = {10.29007/kkds}}
Download PDFOpen PDF in browser