Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Wednesday, March 26, 2014 - 5:00:39 PM
Last modification on : Tuesday, February 12, 2019 - 12:06:02 PM
Long-term archiving on: : Thursday, June 26, 2014 - 11:57:35 AM


Files produced by the author(s)




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



Record views


Files downloads