Building Bridges Between Sets of Partial Orders - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

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.
Fichier principal
Vignette du fichier
lata2015.pdf (274.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01060449 , version 1 (03-09-2014)
hal-01060449 , version 2 (07-10-2014)
hal-01060449 , version 3 (16-10-2014)
hal-01060449 , version 4 (30-10-2014)
hal-01060449 , version 5 (08-12-2014)

Identifiers

  • HAL Id : hal-01060449 , version 5

Cite

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⟩
221 View
252 Download

Share

Gmail Facebook X LinkedIn More