We propose a method for reducing a partially ordered set, in such a way that the lattice derived from a closure operator based on concurrency is changed as little as possible. In fact, we characterize in which cases it remains unchanged, and prove minimality of the resulting reduced poset. In these cases, we can complete this poset so as to obtain a causal net on which the closure operator will lead to the same lattice.
PUERTO AUBEL, A. (2017). Concurrency-preserving minimal process representation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp.242-257). Springer Verlag [10.1007/978-3-319-57418-9_15].
Concurrency-preserving minimal process representation
PUERTO AUBEL, ADRIAN
2017
Abstract
We propose a method for reducing a partially ordered set, in such a way that the lattice derived from a closure operator based on concurrency is changed as little as possible. In fact, we characterize in which cases it remains unchanged, and prove minimality of the resulting reduced poset. In these cases, we can complete this poset so as to obtain a causal net on which the closure operator will lead to the same lattice.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
