Orthomodular Lattices Induced by the Concurrency Relation

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.4204/EPTCS.9.2

We apply to locally finite partially ordered sets a construction which associates a complete lattice to a given poset; the elements of the lattice are the closed subsets of a closure operator, defined starting from the concurrency relation. We show that, if the partially ordered set satisfies a property of local density, i.e.: N-density, then the associated lattice is also orthomodular. We then consider occurrence nets, introduced by C.A. Petri as models of concurrent computations, and define a family of subsets of the elements of an occurrence net; we call those subsets "causally closed" because they can be seen as subprocesses of the whole net which are, intuitively, closed with respect to the forward and backward local state changes. We show that, when the net is K-dense, the causally closed sets coincide with the closed sets induced by the closure operator defined starting from the concurrency relation. K-density is a property of partially ordered sets introduced by Petri, on the basis of former axiomatizations of special relativity theory.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Orthomodular Lattices Induced by the Concurrency Relation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Orthomodular Lattices Induced by the Concurrency Relation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Orthomodular Lattices Induced by the Concurrency Relation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-150249

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.