Browse by author
Lookup NU author(s): Dr Lukasz Mikulski, Dr Andrey Mokhov
This is the authors' accepted manuscript of a conference proceedings (inc. abstract) that has been published in its final definitive form by IEEE, 2017.
For re-use rights please refer to the publisher's terms and conditions.
Relational order structures are used to describe and investigate properties of concurrent systems. To reduce the complexity of order structures, one typically considers only their essential components, which, in the case of partial orders, leads to the notion of Hasse diagrams. We lift this notion to the level of generalised mutex order structures, which are used to model not only causal dependencies but also weak causality and mutual exclusion. We provide a new and more concise axiomatic definition of these structures, investigate their important properties, and present efficient algorithms for computing their reduction and closure. The algorithms are implemented in a publicly available software tool with graphical user interface.
Author(s): Mikulski L, Mokhov A, Piatkowski M
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: 17th International Conference on Application of Concurrency to System Design
Year of Conference: 2017
Online publication date: 13/11/2017
Acceptance date: 19/03/2017
Date deposited: 20/03/2017
Publisher: IEEE
URL: https://doi.org/10.1109/ACSD.2017.17
DOI: 10.1109/ACSD.2017.17
