Between quantum logic and concurrency

We start from two closure operators defined on the elements of a special kind of partially ordered sets. These are called causal nets, and are used to model histories of concurrent processes, recording occurrences of local states and of events. If every maximal chain (line) of the partially ordered set meets every maximal antichain (cut), then the two closure operators coincide, and generate complete orthomodular lattices. In this paper we recall that, for any closed set in this lattice, every line meets either it or its orthocomplement in the lattice, and show that to any line, a two-valued state on the lattice can be associated. Starting from this result, we delineate a logical language whose formulas are interpreted over closed sets of a causal net, where every line induces an assignment of truth values to formulas. The resulting logic is non-classical; we show that maximal antichains in a causal net are associated to Boolean (hence ``classical'') substructures of the overall quantum logic.JRC.G.5-Security technology assessmen