Hybrid Automata as Coalgebras

DOI10.1007/978-3-319-46750-4_22zbMath1400.68111OpenAlexW2522370207MaRDI QIDQ3179412

Renato Neves, Luís Soares Barbosa

Publication date: 21 December 2016

Published in: Theoretical Aspects of Computing – ICTAC 2016 (Search for Journal in Brave)

Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/6831

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Categories of machines, automata (18B20)

Related Items (3)

Hybrid Automata as Coalgebras ⋮ Languages and models for hybrid automata: a coalgebraic perspective ⋮ Limits in categories of Vietoris coalgebras

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Modeling and simulation of cardiac tissue using hybrid I/O automata
• Continuity as a computational effect
• Bisimulation relations for dynamical, control, and hybrid systems
• Introduction to Coalgebra
• Traces for coalgebraic components
• Hybrid Automata as Coalgebras

This page was built for publication: Hybrid Automata as Coalgebras