Closure Operators and Lattices Derived from Concurrency in Posets and Occurrence Nets

Luca Bernardinello, Lucia Pomello, Stefania Rombolà · Fundamenta Informaticae · 2010

Partially ordered sets (posets), and among them occurrence nets, are a natural formal tool for studying concurrent processes. In a poset, the concurrency relation between elements is explicit. Starting from this relation, and applying standard techni

Read the paper · More papers on PaperTik