Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10225772 | Theoretical Computer Science | 2018 | 30 Pages |
Abstract
We study hybrid automata from a coalgebraic point of view. We show that such a perspective supports a generic theory of hybrid automata with a rich palette of definitions and results. This includes, among other things, notions of bisimulation and behaviour, state minimisation techniques, and regular expression languages.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Renato Neves, LuÃs S. Barbosa,