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.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2007, 9 (2), pp.11--31
Liste complète des métadonnées

Littérature citée [24 références]  Voir  Masquer  Télécharger

Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mercredi 26 mars 2014 - 17:00:39
Dernière modification le : mercredi 29 novembre 2017 - 10:26:16
Document(s) archivé(s) le : jeudi 26 juin 2014 - 11:57:35


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00966517, version 1



Thomas Brihaye. Words and bisimulations of dynamical systems. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2007, 9 (2), pp.11--31. 〈hal-00966517〉



Consultations de la notice


Téléchargements de fichiers