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].
Citazione: | 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]. | |
Tipo: | slide + paper | |
Carattere della pubblicazione: | Scientifica | |
Presenza di un coautore afferente ad Istituzioni straniere: | No | |
Titolo: | Concurrency-preserving minimal process representation | |
Autori: | Puerto Aubel, A | |
Autori: | PUERTO AUBEL, ADRIAN (Corresponding) | |
Data di pubblicazione: | 2017 | |
Lingua: | English | |
Nome del convegno: | International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 15-18 May | |
ISBN: | 9783319574172 | |
Serie: | LECTURE NOTES IN COMPUTER SCIENCE | |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1007/978-3-319-57418-9_15 | |
Appare nelle tipologie: | 02 - Intervento a convegno |