Toggle Main Menu Toggle Search

Open Access padlockePrints

Building bridges between sets of partial orders

Lookup NU author(s): Dr Andrey Mokhov


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


© Springer International Publishing Switzerland 2015.Partial orders are a fundamental mathematical structure capable of representing true concurrency and causality on a set of atomic events. In this paper we study two mathematical formalisms capable of the compressed representation of sets of partial orders: Labeled Event Structures (LESs) and Conditional Partial Order Graphs (CPOGs). We demonstrate their advantages and disadvantages and propose efficient algorithms for transforming a set of partial orders from a given compressed representation in one formalism into an equivalent representation in another formalism without the explicit enumeration of each scenario. These transformations reveal the superior expressive power of CPOGs as well as the cost of this expressive power. The proposed algorithms make use of an intermediate mathematical formalism, called Conditional Labeled Event Structures (CLESs), which combines the advantages of LESs and CPOGs. All three formalisms are compared on a number of benchmarks.

Publication metadata

Author(s): Ponce-de-León H, Mokhov A

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 9th International Conference on Language and Automata Theory and Applications (LATA 2015)

Year of Conference: 2015

Pages: 145-160

Online publication date: 24/02/2015

Acceptance date: 01/01/1900

ISSN: 0302-9743

Publisher: Springer Verlag


DOI: 10.1007/978-3-319-15579-1_11

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783319155784