Skip to Main content Skip to Navigation
Conference papers

Building Tight Occurrence Nets from Reveals Relations.

Sandie Balaguer 1 Thomas Chatain 1, 2 Stefan Haar 1, 2
2 MEXICO - Modeling and Exploitation of Interaction and Concurrency
LSV - Laboratoire Spécification et Vérification [Cachan], Inria Saclay - Ile de France
Abstract : 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?
keyword : occurrence nets
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/inria-00638232
Contributor : Stefan Haar <>
Submitted on : Friday, November 4, 2011 - 2:24:42 PM
Last modification on : Monday, April 26, 2021 - 4:24:01 PM
Long-term archiving on: : Thursday, November 15, 2012 - 11:10:45 AM

File

BCH-acsd11.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

275

Files downloads

492