For the most recent entries see the Petri Nets Newsletter.

Ocurrence Net Logics.

Haar, Stefan

In: Burkhard, H.-D.; Czaja, L.; Nguyen, H.-S.; Starke, P.: Proceedings of the CSP'99 Workshop, Warsaw, 28-30 September 1999, pages 59-70. 1999. Extended abstract.

Abstract: 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 casual 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, Winskel 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.

Keywords: Concurrency, Petri nets, Semantics, branching processes, partial order logic.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography