“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
A lattice theoretic view of K-density
Advances in Petri Nets 1984
Nonsequential processes
Interleaving set temporal logic
Theoretical Computer Science
Branching processes of Petri nets
Acta Informatica
Executions: a new partial-order semantics of Petri nets
Theoretical Computer Science
Proving partial order properties
Theoretical Computer Science
Model checking using net unfoldings
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
An Improvement of McMillan's Unfolding Algorithm
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
On the Semantics of Petri Nets
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
ESTL: A Temporal Logic for Events and States
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Probabilistic Cluster Unfoldings
Fundamenta Informaticae
Clusters, Confusion and Unfoldings
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
| Hi-index | 0.00 |
This paper investigates Occurrence (Petri) Nets on two levels: their structural theory and their interpretation in branching unfolding semantics of Petri Net systems. The key issue is the decomposition of occurrence nets into substructures given by the node relations associated with causal ordering, concurrency, and conflict. In addition to lines and cuts, which have long been studied in the context of causal nets ([1]), we introduce and study branches, trails, choices, and alternatives. All finite systems will be shown to satisfy certain density properties, i.e. non-empty intersections of substructures as above. On the semantic level, we introduce partial order logics to be interpreted on two different kind of frames, given by substructures of occurrence nets: on the frame of cuts, the CTL * type logics BFC and BLC, and the “non-branching” logic LLC, taylored to the frame given by the lattice of choices.