Unifying Equivalences for Timed Transition Systems

19 pages•Published: June 22, 2012

Irina Virbitskaite, Natalya Gribovskaya and Eike Best

Abstract

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.

Links:	https://easychair.org/publications/paper/bfc
	https://doi.org/10.29007/kkds

BibTeX entry

@inproceedings{Turing-100:Unifying_Equivalences_Timed_Transition,
  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},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/bfc},
  doi       = {10.29007/kkds},
  pages     = {386-404},
  year      = {2012}}

Download PDF Open PDF in browser