Words and bisimulations of dynamical systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2007

Words and bisimulations of dynamical systems

Abstract

In this paper we study bisimulations on dynamical systems through a given partition. Our aim is to give a new vision of the notion of bisimulation by using words. To achieve this goal, we encode the trajectories of the transition system as words. This method was introduced in our paper ''On o-minimal hybrid systems'' in order to give a new proof of the existence of a finite bisimulation for o-minimal hybrid systems (as previously proved in a paper by Lafferriere G., Pappas G.J. and Sastry S.). Here we want to provide a systematic study of this method in order to obtain a procedure for building finite bisimulations based on words.
Fichier principal
Vignette du fichier
645-2219-1-PB.pdf (283.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00966517 , version 1 (26-03-2014)

Identifiers

Cite

Thomas Brihaye. Words and bisimulations of dynamical systems. Discrete Mathematics and Theoretical Computer Science, 2007, Vol. 9 no. 2 (2), pp.11--31. ⟨10.46298/dmtcs.404⟩. ⟨hal-00966517⟩

Collections

TDS-MACS
59 View
604 Download

Altmetric

Share

Gmail Facebook X LinkedIn More