Languages and models for hybrid automata: a coalgebraic perspective

DOI10.1016/J.TCS.2017.09.038zbMath1400.68112OpenAlexW2766153027MaRDI QIDQ1786567

Renato Neves, Luís Soares Barbosa

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

zbMATH Keywords

coalgebrahybrid automatabisimulationregular expression

Mathematics Subject Classification ID

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)

Related Items (2)

Unnamed Item ⋮ Limits in categories of Vietoris coalgebras

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal paths in weighted timed automata
• The algorithmic analysis of hybrid systems
• Approximate bisimulation: a bridge between computer science and control theory
• Object-oriented hybrid systems of coalgebras plus monoid actions
• Universal coalgebra: A theory of systems
• Continuity as a computational effect
• Bisimulation relations for dynamical, control, and hybrid systems
• A Coalgebraic Perspective on Minimization and Determinization
• Minimization via Duality
• Amir Pnueli and the dawn of hybrid systems
• Limits in categories of Vietoris coalgebras
• Hybrid Automata as Coalgebras
• Verification and Control of Hybrid Systems
• A uniform framework for timed automata
• Coalgebras of bounded type
• Non-Hausdorff Topology and Domain Theory
• Logical Analysis of Hybrid Systems
• Algebra-coalgebra duality in brzozowski's minimization algorithm
• Modularity for timed and hybrid systems

This page was built for publication: Languages and models for hybrid automata: a coalgebraic perspective