Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/ACSD.2017.17 | 2017 17th International Conference on Application of Concurrency to System Design (ACSD) |
Keywords | Field | DocType |
relational order structures,concurrent systems,generalised mutex order structures,publicly available software tool,graphical user interface,relational order structure reduction | Structured systems analysis and design method,Algorithm design,Semaphore,Computer science,Axiom,Reduction of order,Algorithm,Theoretical computer science,Graphical user interface,Concurrent computing,Mutual exclusion | Conference |
ISSN | ISBN | Citations |
1550-4808 | 978-1-5386-2868-3 | 1 |
PageRank | References | Authors |
0.35 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lukasz Mikulski | 1 | 24 | 12.07 |
| Andrey Mokhov | 2 | 136 | 26.57 |
| Marcin Piatkowski | 3 | 35 | 6.79 |