On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems

Abstract : We consider two notions of timed bisimulation on states of continuous-time dynamical systems: global and local timed bisimulation. By analogy with the notion of a bisimulation relation on states of a labeled transition system which requires the existence of matching transitions starting from states in such a relation, local timed bisimulation requires the existence of sufficiently short (locally defined) matching trajectories. Global timed bisimulation requires the existence of arbitrarily long matching trajectories. For continuous-time systems the notion of a global bisimulation is stronger than the notion of a local bisimulation and its definition has a non-local character. In this paper we give a local characterization of global timed bisimulation. More specifically, we consider a large class of abstract dynamical systems called Nondeterministic Complete Markovian Systems (NCMS) which covers various concrete continuous and discrete-continuous (hybrid) dynamical models and introduce the notion of an $f^+$ timed bisimulation, where $f^+$ is a so called extensibility measure. This notion has a local character. We prove that it is equivalent to global timed bisimulation on states of a NCMS. In this way we give a local characterization of the notion of a global timed bisimulation.
Document type :
Conference papers
Complete list of metadatas

Cited literature [37 references]  Display  Hide  Download

https://hal.inria.fr/hal-01446028
Contributor : Hal Ifip <>
Submitted on : Wednesday, January 25, 2017 - 3:24:16 PM
Last modification on : Tuesday, January 2, 2018 - 4:02:05 PM
Long-term archiving on : Wednesday, April 26, 2017 - 4:02:09 PM

File

418352_1_En_13_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Ievgen Ivanov. On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems. 13th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2016, Eindhoven, Netherlands. pp.216-234, ⟨10.1007/978-3-319-40370-0_13⟩. ⟨hal-01446028⟩

Share

Metrics

Record views

65

Files downloads

111