Languages and models for hybrid automata: A coalgebraic perspective
Neves, Renato and Soares Barbosa, Luís, (2018). Languages and models for hybrid automata: A coalgebraic perspective. Theoretical Computer Science, 744 113-142
Document type:
Article
Collection:
-
Related Links Link Description 
https://www.sciencedirect.com/science/article/pii/S0304397517307193#! Article on publisher's website
http://dx.doi.org/10.1016/j.tcs.2017.09.038 Full text from publisher -
Sub-type Journal article Author Neves, Renato
Soares Barbosa, LuísTitle Languages and models for hybrid automata: A coalgebraic perspective Appearing in Theoretical Computer Science Volume 744 Publication Date 2018-10-05 Place of Publication Amsterdam Publisher Elsevier Start page 113 End page 142 Language eng 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. Keyword coalgebra
hybrid automata
bisimulation
regular expressionCopyright Holder Elsevier Copyright Year 2018 Copyright type All rights reserved DOI 10.1016/j.tcs.2017.09.038 -
Citation counts 
Search Google Scholar
Access Statistics: 447 Abstract Views - Detailed Statistics Created: Fri, 31 Jan 2020, 23:20:34 JST by Mario Peixoto on behalf of UNU EGOV