Skip to Main content Skip to Navigation
New interface
Conference papers

Building Bridges Between Sets of Partial Orders

Abstract : Partial orders are a fundamental mathematical structure capable of rep- resenting 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 formal- ism 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Hernan Ponce De Leon Connect in order to contact the contributor
Submitted on : Monday, December 8, 2014 - 6:04:07 PM
Last modification on : Wednesday, February 2, 2022 - 3:53:50 PM
Long-term archiving on: : Monday, March 9, 2015 - 12:26:20 PM


Files produced by the author(s)


  • HAL Id : hal-01060449, version 5


Hernan Ponce de Leon, Andrey Mokhov. Building Bridges Between Sets of Partial Orders. International Conference on Language and Automata Theory and Applications, Mar 2015, Nice, France. ⟨hal-01060449v5⟩



Record views


Files downloads