Hybrid Automata as Coalgebras

dc.contributor.author Renato Jorge Neves en
dc.contributor.author Luís Soares Barbosa en
dc.date.accessioned 2018-01-17T19:17:54Z
dc.date.available 2018-01-17T19:17:54Z
dc.date.issued 2016 en
dc.description.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. en
dc.identifier.uri http://repositorio.inesctec.pt/handle/123456789/6831
dc.identifier.uri http://dx.doi.org/10.1007/978-3-319-46750-4_22 en
dc.language eng en
dc.relation 6181 en
dc.relation 5603 en
dc.rights info:eu-repo/semantics/openAccess en
dc.title Hybrid Automata as Coalgebras en
dc.type conferenceObject en
dc.type Publication en
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
P-00M-475.pdf
Size:
381.76 KB
Format:
Adobe Portable Document Format
Description: