Synthesis of Transition Systems from Quantum Logics

Issue title: Elegant Structures in Computation. To Andrzej Ehrenfeucht on His 85th Birthday

Guest editors: Gheorghe Păun, Grzegorz Rozenberg and Arto Salomaa

Article type: Research Article

Authors: Bernardinello, Luca^{a; *} | Ferigato, Carlo^b | Pomello, Lucia^c | Puerto Aubel, Adrián^d

Affiliations: [a] DISCo, Univ. di Milano–Bicocca, viale Sarca 336-U14, Milano, Italy. luca.bernardinello@unimib.it | [b] European Commission - Joint Research Center (JRC), via E. Fermi 2749, I-21027, Ispra (VA), Italy. carlo.ferigato@jrc.it | [c] DISCo, Univ. di Milano–Bicocca, viale Sarca 336-U14, Milano, Italy. lucia.pomello@unimib.it | [d] DISCo, Univ. di Milano–Bicocca, viale Sarca 336-U14, Milano, Italy

Correspondence: [*] Address for correspondence: DISCo, Univ. di Milano–Bicocca, viale Sarca 336-U14, Milano, Italy

Abstract: The set of elementary regions of a transition system, ordered by set inclusion, forms an orthomodular poset, also referred to as quantum logic, which is regular and rich. Starting from an abstract regular and rich quantum logic, one can construct an elementary transition system such that the orginal logic embeds into its set of regions, and which is saturated of transitions. We study the problem of selecting subsets of transitions on the same set of states, which generate the same set of regions.

DOI: 10.3233/FI-2017-1550

Journal: Fundamenta Informaticae, vol. 154, no. 1-4, pp. 25-36, 2017