Building Tight Occurrence Nets from Reveals Relations.Report as inadecuate

Building Tight Occurrence Nets from Reveals Relations. - Download this document for free, or read online. Document in PDF available to download.

1 LSV - Laboratoire Spécification et Vérification Cachan 2 MEXICO - Modeling and Exploitation of Interaction and Concurrency LSV - Laboratoire Spécification et Vérification Cachan, ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643

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 5510: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

Author: Sandie Balaguer - Thomas Chatain - Stefan Haar -



Related documents