DC ElementWertSprache
dc.contributor.authorCapra, Lorenzo-
dc.contributor.authorKöhler-Bußmeier, Michael-
dc.date.accessioned2024-01-18T08:55:50Z-
dc.date.available2024-01-18T08:55:50Z-
dc.date.issued2024-
dc.identifier.issn0304-3975en_US
dc.identifier.urihttp://hdl.handle.net/20.500.12738/14570-
dc.description.abstractModern distributed systems are becoming pervasive and increasingly provided with adaptation, (self-)reconfiguration and mobility capability. On one side, to face the challenges of the highly dynamic environments where they are deployed. On the other side, to keep production/maintenance costs down. Therein lies the increasing demand for formal models encompassing all of these aspects (besides concurrency). Hardly any of the classical formalisms like Petri Nets, Automata, and Process Algebra, even though powerful, permits designers to easily specify dynamic structural changes to systems and evaluate their impact on system behaviour. That has led to several extensions of classical formal models (e.g., the Pi calculus or the Nets-within-Nets paradigm) rarely accompanied by suitable analysis techniques. A recent formalization of a class of Rewritable Place-Transition Nets (RwPT) in Maude has proved potentially convenient to specify dynamically reconfigurable systems. Concerning analogous proposals, the RwPT formalism provides more abstraction/flexibility in modelling and efficiency in analysis. Nevertheless, its ability to scale the size of distributed systems built of several similar (nested) components is limited. This paper presents a compositional approach to define large RwPT models in a typical algebraic way and to exploit the modular structure of models during the analysis: Symmetries are implicitly captured by composite node-labelling (reflecting the model's hierarchical structure) that is preserved by net rewrites. A distributed, gracefully degrading production system is used as a case study. Experimental evidence points out the dramatic impact of the approach against a non-modular one and the advantages over alternative techniques. Even if the emphasis is on state-space-based verification, the paper shows the convenience of combining it with structural analysis, which is typical of Petri nets as well. For that purpose, rewrite-rule abstractions are given in the form of guidelines.en
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofTheoretical computer scienceen_US
dc.subjectMaudeen_US
dc.subjectPT netsen_US
dc.subjectDistributed systemsen_US
dc.subjectAdaptationen_US
dc.subjectModel-checkingen_US
dc.subject.ddc004: Informatiken_US
dc.titleModular rewritable petri nets : an efficient model for dynamic distributed systemsen
dc.typePreprinten_US
dc.description.versionReviewPendingen_US
tuhh.container.volume:tbaen_US
tuhh.oai.showtrueen_US
tuhh.publication.instituteDepartment Informatiken_US
tuhh.publication.instituteFakultät Technik und Informatiken_US
tuhh.publisher.doi10.1016/j.tcs.2024.114397-
tuhh.type.opusPreprint (Vorabdruck)-
dc.rights.cchttps://creativecommons.org/licenses/by/4.0/en_US
dc.type.casraiOther-
dc.type.dinipreprint-
dc.type.driverpreprint-
dc.type.statusinfo:eu-repo/semantics/submittedVersionen_US
dcterms.DCMITypeText-
local.comment.externalarticle number: 114397en_US
item.creatorGNDCapra, Lorenzo-
item.creatorGNDKöhler-Bußmeier, Michael-
item.languageiso639-1en-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_816b-
item.creatorOrcidCapra, Lorenzo-
item.creatorOrcidKöhler-Bußmeier, Michael-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairetypePreprint-
crisitem.author.deptDepartment Informatik-
crisitem.author.orcid0000-0002-3074-4145-
crisitem.author.parentorgFakultät Technik und Informatik-
Enthalten in den Sammlungen:Publications without full text
Zur Kurzanzeige

Seitenansichten

29
checked on 27.11.2024

Google ScholarTM

Prüfe

HAW Katalog

Prüfe

Volltext ergänzen

Feedback zu diesem Datensatz


Diese Ressource wurde unter folgender Copyright-Bestimmung veröffentlicht: Lizenz von Creative Commons Creative Commons