Building Tight Occurrence Nets from Reveals Relations. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Building Tight Occurrence Nets from Reveals Relations.


Occurrence nets are a well known partial order model for the concurrent behavior of Petri nets. The causality and conflict relations between events, which are explicitly represented in occurrence nets, induce logical dependencies between event occurrences: the occurrence of an event e in a run implies that all its causal predecessors also occur, and that no event in conflict with e occurs. But these structural relations do not express all the logical dependencies between event occurrences in maximal runs: in particular, the occurrence of e in any maximal run may imply the occurrence of another event that is not a causal predecessor of e, in that run. The reveals relation has been introduced in [Haar, IEEE TAC 55(10):2310-2320, 2010] to express this dependency between two events. Here we generalize the reveals relation to express more general dependencies, involving more than two events, and we introduce ERL logic to express them as boolean formulas. Finally we answer the synthesis problem that arises: given an ERL formula φ, is there an occurrence net N such that φ describes exactly the dependencies between the events of N?



Other [cs.OH]
Fichier principal
Vignette du fichier
BCH-acsd11.pdf (192.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00638232 , version 1 (04-11-2011)



Sandie Balaguer, Thomas Chatain, Stefan Haar. Building Tight Occurrence Nets from Reveals Relations.. ACSD 2011, Jun 2011, Newcastle, United Kingdom. pp.44-53, ⟨10.1109/ACSD.2011.16⟩. ⟨inria-00638232⟩
98 View
161 Download



Gmail Facebook X LinkedIn More