Thomas Brihaye - Words and bisimulations of dynamical systems

dmtcs:404 - Discrete Mathematics & Theoretical Computer Science, January 1, 2007, Vol. 9 no. 2 -
Words and bisimulations of dynamical systemsArticle

Authors: Thomas Brihaye 1

  • 1 Institut de Mathématiques [Mons]

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.

Volume: Vol. 9 no. 2
Published on: January 1, 2007
Imported on: March 26, 2015
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

1 Document citing this article

Consultation statistics

This page has been seen 245 times.
This article's PDF has been downloaded 250 times.