Please use this identifier to cite or link to this item:
|Title:||Hybrid Automata as Coalgebras|
|Authors:||Renato Jorge Neves|
Luís Soares Barbosa
|Abstract:||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.|
|Appears in Collections:||HASLab - Articles in International Conferences|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.