Characterizing Right Inverses for Spatial Constraint Systems with Applications to Modal Logic

Michell Guzmán (1) , Salim Perchy (1) , Camilo Rueda (2) , Frank Valencia (1, 2)

1 COMETE - Concurrency, Mobility and Transactions
2 Pontificia universidad Javeriana, Cali

Spatial constraint systems are algebraic structures from concurrent constraint programming to specify spatial and epistemic behavior in multi-agent systems. In this paper spatial constraint systems are used to give an abstract characterization of the notion of normality in modal logic and to derive right inverse/reverse operators for modal languages. In particular, a necessary and sufficient condition for the existence of right inverses is identified and the abstract notion of normality is shown to correspond to the preservation of finite suprema. Furthermore, a taxonomy of normal right inverses is provided, identifying the greatest normal right inverse as well as the complete family of minimal right inverses. These results are applied to existing modal languages such $ as the weakest normal modal logic, Hennessy-Milner logic, and linear-time temporal logic. Some implications of these results are also discussed in the context of modal concepts such as bisimilarity and inconsistency invariance.

Mots clés: constraint systems; inverse operators; modal logic; concurrency theory; concurrent constraint programming; Modal algebra

Domaines: Logique en informatique [cs.LO]; Informatique et théorie des jeux [cs.GT]; Calcul parallèle, distribué et partagé [cs.DC]; Théorie et langage formel [cs.FL]

Michell Guzmán, Salim Perchy, Camilo Rueda, Frank Valencia. Characterizing Right Inverses for Spatial Constraint Systems with Applications to Modal Logic. Theoretical Computer Science, 2018, 744 (56--77). ⟨hal-01675010v2⟩