Topologies, Continuity and Bisimulations
DOI10.1051/ita:1999123zbMath0940.03021OpenAlexW2169823769MaRDI QIDQ4943548
Publication date: 16 March 2000
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222075
set-valued mapsdecidabilityalgebraic semanticsmodal \(\mu\)-calculusAlexandroff topologysemi-continuitybisimulation relationfirst-order definable hybrid dynamical systemsformal analysis and verification of hybrid control systems
Set-valued maps in general topology (54C60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44) Model systems in control theory (93C99) Other applications of logic (03B80)
Related Items
Uses Software
Cites Work
- Duality and the completeness of the modal \(\mu\)-calculus
- The algorithmic analysis of hybrid systems
- Results on the propositional \(\mu\)-calculus
- What's decidable about hybrid automata?
- Characterizations of negative definability in modal logic
- O-minimal hybrid systems.
- A Note on the Completeness of Kozen's Axiomatisation of the Propositional μ-Calculus
- Boolean Algebras with Operators. Part I
- Set-valued analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item