Unifying Equivalences for Timed Transition Systems
Irina Virbitskaite, Nataliya Gribovskaya, Eike Best
Abstract
Open-access reader
Irina Virbitskaite, Nataliya Gribovskaya, Eike Best
Abstract
Open-access reader
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Bisimulation, Transition system, Computer science, Categorical variable, Transition (genetics), Theoretical computer science, Branching (polymer chemistry), Path (computing)