Hybrid Automata as Coalgebras
- Citation:
- Neves R, Barbosa LS. 2016. Hybrid Automata as Coalgebras. Theoretical Aspects of Computing - ICTAC 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings. 9965:385–402.
Tertiary Title:
Lecture Notes in Computer ScienceAbstract:
Able to simultaneously encode discrete transitions and continuous behaviour, hybrid automata are the de facto framework for the formal specification and analysis of hybrid systems. The current paper revisits hybrid automata from a coalgebraic point of view. This allows to interpret them as state-based components, and provides a uniform theory to address variability in their definition, as well as the corresponding notions of behaviour, bisimulation, and observational semantics.
Notes:
n/a
Citation Key:
DBLP:conf/ictac/NevesB16
Copyright © by the contributing authors. All material on this collaboration platform is the property of the contributing authors.