Taming Hierarchical Connectors - Fundamentals of Software Engineering Access content directly
Conference Papers Year : 2019

Taming Hierarchical Connectors

Abstract

Building 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.
Fichier principal
Vignette du fichier
490001_1_En_13_Chapter.pdf (632.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03769113 , version 1 (05-09-2022)

Licence

Attribution

Identifiers

Cite

José Proença, Alexandre Madeira. Taming Hierarchical Connectors. 8th International Conference on Fundamentals of Software Engineering (FSEN), May 2019, Tehran, Iran. pp.186-193, ⟨10.1007/978-3-030-31517-7_13⟩. ⟨hal-03769113⟩
16 View
4 Download

Altmetric

Share

Gmail Facebook X LinkedIn More