Skip to Main content Skip to Navigation
Conference papers

Computing the Reveals Relation in Occurrence Nets

Abstract : Petri net unfoldings are a useful tool to tackle state-space explosion in verification and related tasks. Moreover, their structure allows to access directly the relations of causal precedence, concurrency, and conflict between events. Here, we explore the data structure further, to determine the following relation: event a is said to reveal event b iff the occurrence of a implies that b inevitably occurs, too, be it before, after, or concurrently with a. Knowledge of reveals facilitates in particular the analysis of partially observable systems, in the context of diagnosis, testing, or verification; it can also be used to generate more concise representations of behaviours via abstractions. The reveals relation was previously introduced in the context of fault diagnosis, where it was shown that the reveals relation was decidable: for a given pair a,b in the unfolding U of a safe Petri net N, a finite prefix P of U is sufficient to decide whether or not a reveals b. In this paper, we first considerably improve the bound on |P|. We then show that there exists an efficient algorithm for computing the relation on a given prefix. We have implemented the algorithm and report on experiments.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/inria-00638262
Contributor : Stefan Haar <>
Submitted on : Friday, November 4, 2011 - 2:23:25 PM
Last modification on : Monday, February 15, 2021 - 10:50:25 AM
Long-term archiving on: : Thursday, November 15, 2012 - 11:10:59 AM

File

HKS-gandalf11.pdf
Files produced by the author(s)

Identifiers

Citation

Stefan Haar, Christian Kern, Stefan Schwoon. Computing the Reveals Relation in Occurrence Nets. Gandalf, Jun 2011, Minori, Italy. pp.31-44, ⟨10.4204/EPTCS.54.3⟩. ⟨inria-00638262⟩

Share

Metrics

Record views

326

Files downloads

625