Behavioural equivalences for timed systems
arXiv:1711.10233 · doi:10.23638/LMCS-15(1:17)2019
Abstract
Timed transition systems are behavioural models that include an explicit treatment of time flow and are used to formalise the semantics of several foundational process calculi and automata. Despite their relevance, a general mathematical characterisation of timed transition systems and their behavioural theory is still missing. We introduce the first uniform framework for timed behavioural models that encompasses known behavioural equivalences such as timed bisimulations, timed language equivalences as well as their weak and time-abstract counterparts. All these notions of equivalences are naturally organised by their discriminating power in a spectrum. We prove that this result does not depend on the type of the systems under scrutiny: it holds for any generalisation of timed transition system. We instantiate our framework to timed transition systems and their quantitative extensions such as timed probabilistic systems.
References in corpus (11)
- A 2-categories companion
- Generalizing determinization from automata to coalgebras
- Generic Trace Semantics via Coinduction
- Relating coalgebraic notions of bisimulation
- Coinduction up to in a fibrational setting
- Behavioural equivalences for coalgebras with unobservable moves
- Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems
- GSOS for non-deterministic processes with quantitative aspects
- Weak bisimulation for coalgebras over order enriched monads
- Weak bisimulations for labelled transition systems weighted over semirings
- Lax functors and coalgebraic weak bisimulation