Topologies, Continuity and Bisimulations
RAIRO-Theor. Inf. Appl., 33 4-5 (1999) 357-381
Published online: 2002-08-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Modal compact Hausdorff spaces
G. Bezhanishvili, N. Bezhanishvili and J. HardingJournal of Logic and Computation 25 (1) 1 (2015)
https://doi.org/10.1093/logcom/exs030
A BEHAVIOR-PRESERVING TRANSLATION FROM FBD DESIGN TO C IMPLEMENTATION FOR REACTOR PROTECTION SYSTEM SOFTWARE
JUNBEOM YOO, EUI-SUB KIM and JANG-SOO LEENuclear Engineering and Technology 45 (4) 489 (2013)
https://doi.org/10.5516/NET.04.2012.085
Metrics for weighted transition systems: Axiomatization and complexity
Kim G. Larsen, Uli Fahrenberg and Claus ThraneTheoretical Computer Science 412 (28) 3358 (2011)
https://doi.org/10.1016/j.tcs.2011.04.003
O-Minimal Hybrid Reachability Games
Patricia Bouyer, Thomas Brihaye and Fabrice ChevalierLogical Methods in Computer Science Volume 6, Issue 1 (2010)
https://doi.org/10.2168/LMCS-6(1:1)2010
Weighted o-minimal hybrid systems
Patricia Bouyer, Thomas Brihaye and Fabrice ChevalierAnnals of Pure and Applied Logic 161 (3) 268 (2009)
https://doi.org/10.1016/j.apal.2009.07.014
On intuitionistic modal and tense logics and their classical companion logics: Topological semantics and bisimulations
J.M. DavorenAnnals of Pure and Applied Logic 161 (3) 349 (2009)
https://doi.org/10.1016/j.apal.2009.07.009
Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems
Margarita Korovina and Nicolai VorobjovTheory of Computing Systems 43 (3-4) 498 (2008)
https://doi.org/10.1007/s00224-007-9019-4
Handbook of Spatial Logics
Rohit Parikh, Lawrence S. Moss and Chris SteinsvoldHandbook of Spatial Logics 299 (2007)
https://doi.org/10.1007/978-1-4020-5587-4_6
Logical Foundations of Computer Science
Patricia Bouyer, Thomas Brihaye and Fabrice ChevalierLecture Notes in Computer Science, Logical Foundations of Computer Science 4514 69 (2007)
https://doi.org/10.1007/978-3-540-72734-7_6
Logical Foundations of Computer Science
J. M. DavorenLecture Notes in Computer Science, Logical Foundations of Computer Science 4514 162 (2007)
https://doi.org/10.1007/978-3-540-72734-7_12
367 (2006)
https://doi.org/10.1109/LICS.2006.22
A note on the undecidability of the reachability problem for o-minimal dynamical systems
Thomas BrihayeMLQ 52 (2) 165 (2006)
https://doi.org/10.1002/malq.200510024
Formal Modeling and Analysis of Timed Systems
Raffaella GentiliniLecture Notes in Computer Science, Formal Modeling and Analysis of Timed Systems 3829 162 (2005)
https://doi.org/10.1007/11603009_14
On the expressiveness and decidability of o-minimal hybrid systems
Thomas Brihaye and Christian MichauxJournal of Complexity 21 (4) 447 (2005)
https://doi.org/10.1016/j.jco.2004.09.003
Logics for hybrid systems
J.M. Davoren and A. NerodeProceedings of the IEEE 88 (7) 985 (2000)
https://doi.org/10.1109/5.871305
Discrete abstractions of hybrid systems
R. Alur, T.A. Henzinger, G. Lafferriere and G.J. PappasProceedings of the IEEE 88 (7) 971 (2000)
https://doi.org/10.1109/5.871304