Occurrence Net Logics - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1999

Occurrence Net Logics

Stefan Haar
  • Function : Author
  • PersonId : 835332


This paper investigates structural properties of occurrence (Petri) nets and their interpretation as unfolding semantics of Petri net systems. Occurrence nets (ONs) exhibit three kinds of node relations associated with causal ordering, concurrency, and conflict. We show that ONs can be decomposed in a natural way into substructures in each of which one or two of these relations are empty, namely: branches, trails, choices, lines, cuts and alternatives. All finite systems will be shown to satisfy certain density properties, i.e. non-empty intersections of substructures as above. Two unfolding semantics are studied: branching processes (introduced by Engelfriet, Wynskel et al.) and branching executions (Vogler). We present two partial order logics that can be interpreted over occurrence net semantics of either kind: the branching time logic BLC and a non-branching logic LLC whose frame is composed of choices, i.e. objects representing horizons of mutually exclusive global states compatible with the corresponding stage of the system.
No file

Dates and versions

inria-00098861 , version 1 (26-09-2006)


  • HAL Id : inria-00098861 , version 1


Stefan Haar. Occurrence Net Logics. Workshop Concurrency, Specification & Programming - CS & P'99, Universite de Varsovie, 1999, Varsovie/Pologne, 12 p. ⟨inria-00098861⟩
67 View
0 Download


Gmail Facebook Twitter LinkedIn More