Languages and models for hybrid automata: a coalgebraic perspective
DOI10.1016/J.TCS.2017.09.038zbMATH Open1400.68112OpenAlexW2766153027MaRDI QIDQ1786567FDOQ1786567
Publication date: 24 September 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1822/69183
Recommendations
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories of machines, automata (18B20)
Cites Work
- Universal coalgebra: A theory of systems
- A Coalgebraic Perspective on Minimization and Determinization
- Verification and Control of Hybrid Systems
- Title not available (Why is that?)
- Algebra-coalgebra duality in brzozowski's minimization algorithm
- Non-Hausdorff Topology and Domain Theory
- Modularity for timed and hybrid systems
- The algorithmic analysis of hybrid systems
- Title not available (Why is that?)
- Optimal paths in weighted timed automata
- Title not available (Why is that?)
- Bisimulation relations for dynamical, control, and hybrid systems
- Amir Pnueli and the dawn of hybrid systems
- Logical Analysis of Hybrid Systems
- Approximate bisimulation: a bridge between computer science and control theory
- Minimization via Duality
- Coalgebras of bounded type
- Continuity as a computational effect
- Title not available (Why is that?)
- Object-oriented hybrid systems of coalgebras plus monoid actions
- Title not available (Why is that?)
- Weighted timed automata: model-checking and games
- Limits in categories of Vietoris coalgebras
- Hybrid Automata as Coalgebras
- A uniform framework for timed automata
Cited In (2)
This page was built for publication: Languages and models for hybrid automata: a coalgebraic perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786567)
