Words and bisimulations of dynamical systems

Discrete Mathematics and Theoretical Computer Science

Volumn 9, Issue 2, 2007, Pages 11-32

  Brihaye, Thomas ^a  

^a UNIVERSITY OF MONS   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; ENCODING (SYMBOLS); HYBRID COMPUTERS; WORD PROCESSING;

BISIMULATIONS; LAFFERRIERE G; TRANSITION SYSTEM;

DYNAMICAL SYSTEMS;

EID: 34547350603     PISSN: 14627264     EISSN: 13658050     Source Type: Journal    
DOI: None     Document Type: Article

References (25)

1. R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P;-H. Ho, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoret. Comput. Sci., 138(1):3-34, 1995. Special issue on hybrid systems.
2. P. Aczel. Non-well-founded sets, volume 14 of CSLI Lecture Notes. Stanford University Center for the Study of Language and Information, Stanford, CA, 1988. With a foreword by Jon Barwise [K. Jon Barwise].
3. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
4. R. Alur, T.A. Henzinger, G. Lafferriere, and G.J. Pappas. Discrete abstractions of hybrid systems. Proceedings of the IEEE, 88:971-984, 2000.
5. Eugene Asarin, Gerardo Schneider, and Sergio Yovine. On the decidability of the reachability problem for planar differential inclusions. In Di Benedetto and Maria Domenica, editors, HSCC'2001, volume 2034 of Lecture Notes in Computer Science, pages 89-104. Springer, 2001.
6. V. Bruyère and O. Carton. Automata on linear orderings. In Mathematical foundations of computer science, 2001 (Mariánské Lázně), volume 2136 of Lecture Notes in Comput. Sci., pages 236-247. Springer, Berlin, 2001.
7. A. Bouajjani, J.-C. Fernandez, and N. Halbwachs. Minimal model generation. In E. M. Clarke and R. P. Kurshan, editors, Computer-Aided Verification: Proc. of the 2nd International Conference CAV'90, pages 197-203. Springer, Berlin, Heidelberg, 1991.
8. Thomas Brihaye and Christian Michaux. On the expressiveness and decidability of o-minimal hybrid systems. Journal of Complexity, 21(4):447-478, 2005.
9. T. Brihaye, C. Michaux, C. Rivière, and C. Troestler. On o-minimal hybrid systems. In Rajeev Alur and George J. Pappas, editors, HSCC'2004, volume 2993 of Lecture Notes in Computer Science, pages 219-233. Springer, 2004.
10. D. Caucal. Bisimulation of context-free grammars and of pushdown automata. In Modal logic and process algebra (Amsterdam, 1994), volume 53 of CSLI Lecture Notes, pages 85-106. CSLI Publ., Stanford, CA, 1995.
11. J.M. Davoren. Topologies, continuity and bisimulations. Theor. Inform. Appl., 33(4-5):357-381, 1999. Fixed points in computer science (Brno, 1998).
12. T.A. Henzinger. Hybrid automata with finite bisimulations. In ICALP 95: Automata, Languages, and Programming, Lecture Notes in Computer Science 944, pages 324-335. Springer-Verlag, 1995.
13. T.A. Henzinger. The theory of hybrid automata. In Proceedings of the 11th Annual Symposium on Logic in Computer Science, pages 278-292. IEEE Computer Society Press, 1996.
14. Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, and Pravin Varaiya. What's decidable about hybrid automata? J. Comput. System Sci., 57(1):94-124, 1998. 27th Annual ACM Symposium on the Theory of Computing (STOC'95) (Las Vegas, NV).
15. T.A. Henzinger., X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Inform, and Comput., 111(2): 193-244, 1994. 1992 IEEE Symposium on Logic in Computer Science.
16. A.A. Julius and A.J.van der Schaft. State maps of general behaviors, their lattice structure and bisimulations. In Proceedings of the Sixteenth International Symposium on Mathematical Theory of Networks and Systems (MTNS2004), 2004.
17. Paris C. Kanellakis and Scott A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Inform, and Comput., 86(1):43-68, 1990.
18. M. Korovina and N. Vorobjov. Pfaffian hybrid systems. In Jerzy Marcinkowski and Andrzej Tarlecki, editors, CSL 2004, volume 3210 of Lecture Notes in Computer Science, pages 430-441. Springer-Ver lag, 2004.
19. Margarita V. Korovina and Nicolai Vorobjov. Upper and lower bounds on sizes of finite bisimulations of Pfaffian hybrid systems. In CiE, volume 3988 of Lecture Notes in Computer Science, pages 267-276. Springer, 2006.
20. G. Lafferriere, G. J. Pappas, and S. Sastry. O-minimal hybrid systems. Math. Control Signals Systems, 13(1):1-21, 2000.
21. A. Rabinovich. Automata over continuous time. Theoret. Comput. Sci., 300(1-3):331-363, 2003.
22. S. N. Simic, K. H. Johansson, S. Sastry, and J. Lygeros. Towards a geometric theory of hybrid systems. In N. Lynch et al, editor, HSCC'2000, volume 1790 of Lecture. Notes in Computer Science, pages 421-436. Springer, 2000.
23. J. K. Truss. Infinite permutation groups. II. Subgroups of small index. J. Algebra, 120(2):494-515, 1989.
24. L. van den Dries. Tame topology and o-minimal structures, volume 248 of London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge, 1998.
25. Jan C. Willems. Paradigms and puzzles in the theory of dynamical systems. IEEE Trans. Automat. Control, 36(3):259-294, 1991.