Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/27067
Full metadata record
DC FieldValueLanguage
dc.contributor.authorProença, Josépt_PT
dc.contributor.authorMadeira, Alexandrept_PT
dc.date.accessioned2019-12-03T10:26:53Z-
dc.date.available2019-12-03T10:26:53Z-
dc.date.issued2019-
dc.identifier.isbn978-3-030-31516-0pt_PT
dc.identifier.urihttp://hdl.handle.net/10773/27067-
dc.description.abstractBuilding and maintaining complex systems requires good software engineering practices, including code modularity and reuse. The same applies in the context of coordination of complex component-based systems. This paper investigates how to verify properties of complex coordination patterns built hierarchically, i.e., built from composing blocks that are in turn built from smaller blocks. Most existing approaches to verify properties flatten these hierarchical models before the verification process, losing the hierarchical structure. We propose an approach to verify hierarchical models using containers as actions; more concretely, containers interacting with their neighbours. We present a dynamic modal logic tailored for hierarchical connectors, using Reo and Petri Nets to illustrate our approach. We realise our approach via a prototype implementation available online to verify hierarchical Reo connectors, encoding connectors and formulas into mCRL2 specifications and formulas.pt_PT
dc.language.isoengpt_PT
dc.publisherSpringerpt_PT
dc.relationPOCI-01-0145-FEDER-029946pt_PT
dc.relationPOCI-01-0145-FEDER-016692pt_PT
dc.rightsopenAccesspt_PT
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/pt_PT
dc.subjectDynamic logicpt_PT
dc.subjectSoftware connectorspt_PT
dc.subjectFormal methodspt_PT
dc.titleTaming hierarchical connectorspt_PT
dc.typebookPartpt_PT
dc.description.versionpublishedpt_PT
dc.peerreviewedyespt_PT
degois.publication.firstPage186pt_PT
degois.publication.lastPage193pt_PT
degois.publication.locationChampt_PT
degois.publication.titleFundamentals of Software Engineering. FSEN 2019. Lecture Notes in Computer Sciencept_PT
degois.publication.volume11761-
dc.relation.publisherversionhttps://link.springer.com/chapter/10.1007/978-3-030-31517-7_13pt_PT
dc.identifier.doi10.1007/978-3-030-31517-7_13pt_PT
dc.identifier.esbn978-3-030-31517-7pt_PT
Appears in Collections:CIDMA - Capítulo de livro
AGG - Capítulo de livro

Files in This Item:
File Description SizeFormat 
paper_41.pdf509.92 kBAdobe PDFView/Open


FacebookTwitterLinkedIn
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.