Journal Articles Theoretical Computer Science Year : 2018

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

Abstract

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.
Fichier principal
Vignette du fichier
final-tcs.pdf (509) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01675010 , version 1 (03-01-2018)
hal-01675010 , version 2 (15-05-2018)

Identifiers

  • HAL Id : hal-01675010 , version 2

Cite

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⟩
552 View
269 Download

Share

More