Languages and models for hybrid automata: a coalgebraic perspective

DOI10.1016/J.TCS.2017.09.038MaRDI QIDQ1786567zbMATH OpenOpenAlexFDO

Authors Renato Neves, L. S. 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

hybrid automatacoalgebrabisimulationregular 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)

Recommendations

• Hybrid automata as coalgebras
• scientific article; zbMATH DE number 1507210
• scientific article; zbMATH DE number 1304993
• Hybrid automata and bisimulations
• Stream Automata Are Coalgebras

Cites work

• scientific article; zbMATH DE number 1696496 (Why is no real title available?)
• scientific article; zbMATH DE number 1301613 (Why is no real title available?)
• scientific article; zbMATH DE number 1301623 (Why is no real title available?)
• scientific article; zbMATH DE number 2172972 (Why is no real title available?)
• scientific article; zbMATH DE number 195102 (Why is no real title available?)
• A Coalgebraic Perspective on Minimization and Determinization
• A uniform framework for timed automata
• Algebra-coalgebra duality in Brzozowski's minimization algorithm
• Amir Pnueli and the dawn of hybrid systems
• Approximate bisimulation: a bridge between computer science and control theory
• Bisimulation relations for dynamical, control, and hybrid systems
• Coalgebras of bounded type
• Continuity as a computational effect
• Hybrid automata as coalgebras
• Limits in categories of Vietoris coalgebras
• Logical analysis of hybrid systems. Proving theorems for complex dynamics.
• Minimization via duality
• Modularity for timed and hybrid systems
• Non-Hausdorff topology and domain theory. Selected topics in point-set topology
• Object-oriented hybrid systems of coalgebras plus monoid actions
• Optimal paths in weighted timed automata
• The algorithmic analysis of hybrid systems
• Universal coalgebra: A theory of systems
• Verification and Control of Hybrid Systems
• Weighted timed automata: model-checking and games

Cited in

(4)

• A semantics for hybrid iteration
• Relational Methods in Computer Science
• Hybrid automata as coalgebras
• Limits in categories of Vietoris coalgebras

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)