Languages and models for hybrid automata: A coalgebraic perspective
Languages and models for hybrid automata: A coalgebraic perspective
dc.contributor.author | Luís Soares Barbosa | en |
dc.contributor.author | Renato Jorge Neves | en |
dc.contributor.other | 6181 | en |
dc.contributor.other | 5603 | en |
dc.date.accessioned | 2019-12-14T16:49:21Z | |
dc.date.available | 2019-12-14T16:49:21Z | |
dc.date.issued | 2018 | en |
dc.description.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. | en |
dc.identifier.uri | http://repositorio.inesctec.pt/handle/123456789/10521 | |
dc.identifier.uri | http://dx.doi.org/10.1016/j.tcs.2017.09.038 | en |
dc.language | eng | en |
dc.rights | info:eu-repo/semantics/openAccess | en |
dc.title | Languages and models for hybrid automata: A coalgebraic perspective | en |
dc.type | Publication | en |
dc.type | article | en |
Files
Original bundle
1 - 1 of 1