Nonsequential processes
Theoretical Computer Science - Special volume on Petri nets
A new kind of science
Petri's Axioms of Concurrency- A Selection of Recent Results
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
On the Physical Basics of Information Flow
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Petri Nets, Discrete Physics, and Distributed Quantum Computation
Concurrency, Graphs and Models
| Hi-index | 0.00 |
In this paper, we study partially ordered structures associated to occurrence nets. An occurrence net is endowed with a symmetric, but in general non transitive, concurrency relation. By applying known techniques in lattice theory, from any such relation one can derive a closure operator, and then an orthocomplemented lattice. We prove that, for a general class of occurrence nets, those lattices, formed by closed subsets of net elements, are orthomodular. A similar result was shown starting from a simultaneity relation defined, in the context of special relativity theory, on Minkowski spacetime. We characterize the closed sets, and study several properties of lattices derived from occurrence nets; in particular we focus on properties related to K-density. We briefly discuss some variants of the construction, showing that, if we discard conditions, and only keep the partial order on events, the corresponding lattice is not, in general, orthomodular.