Show simple item record

dc.contributor.authorAbd Alrahman, Yehia
dc.contributor.authorMartel, Mauricio
dc.contributor.authorPiterman, Nir
dc.date.accessioned2022-11-17T13:29:45Z
dc.date.available2022-11-17T13:29:45Z
dc.date.issued2022
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.identifier.urihttps://hdl.handle.net/2077/74182
dc.description.abstractWe consider partial order semantics of concurrent systems in which local reconfigurations may have global side effects. That is, local changes happening to an entity may block or unblock events relating to others, namely, events in which the entity does not participate. We show that partial order computations need to capture additional restrictions about event ordering, i.e., restrictions that arise from such reconfigurations. This introduces ambiguity where different partial orders represent exactly the same events with the same participants happening in different orders, thus defeating the purpose of using partial order semantics. To remove this ambiguity, we suggest an extension of partial orders called glued partial orders. We show that glued partial orders capture all possible forced reordering arising from said reconfigurations. Furthermore, we show that computations belonging to different glued partial orders are only different due to non-determinism. We consider channeled transition systems and Petri-nets with inhibiting arcs as examples.
dc.language.isoengen
dc.titleA PO Characterisation of Reconfigurationen
dc.typeTexten
dc.type.svepconference paper, peer revieweden


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record