Abstract
Modal logics typically have only one domain of discourse—i.e., the collection of worlds or states. For distributed computing systems, however, it makes sense to have several collections of worlds and to relate one domain’s local worlds to another’s using either relations or special maps. To this end, we introduce distributed modal logics. Distributed modal logics lift the distribution structure of a distributed system directly into the logic, thereby parameterizing the logic by the distribution structure itself. Each domain supports a “local logic” (which can itself be a modal logic). The connections between local logics are realized as “distributed modal connectives” where these connectives take propositions in one logic to propositions in another. Weak distributed logic systems require neighborhood semantics and, hence, the connection between domains becomes a neighborhood map linking each world in one domain to a collection of neighborhoods in another domain. In sufficiently strong distributed logic systems, the maps may be Kripke relations linking worlds from two different domains. We briefly illustrate distributed modal logics with the outline of a security verification for a hardware distributed system (i.e., a system-on-a-chip) with components that must be woven into proofs of security statements. Distributed modal logics also support probabilistic systems using stochastic relations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Adámek, J., & Rosický, J. (1994). Locally presentable and accessible categories, London Mathematical Society. Lecture Note Series 189.
Allwein, G. (2005). A qualitative framework for Shannon information theories. In Proceedings of the New Security Paradigms Workshop, 2004 (pp. 23–31). ACM Press.
Allwein, G., & Dunn, J. M. (1993). Kripke semantics for linear logic. Journal of Symbolic Logic, 58(2), 514–545.
Allwein, G., & Harrison, W. (2010). Partially-ordered Modalities. Proceedings of the Advances in Modal Logic Conference, 8, 1–21.
Allwein, G., Harrison, W., & Andrews, D. (2014). Simulation logic. Logic and Logical Philosophy, 23(3), 277–299.
Barwise, J., & Feferman, S. (Eds.). (1985). Model-theoretic logics. Springer.
Barwise, J., & Seligman, J. (1993). Imperfect information flow, Logic in Computer Science, 1993. LICS ’93 (pp. 252–260). IEEE.
Barwise, J., & Seligman, J. (1997). Information flow: The logic of distributed systems. CUP. Cambridge Tracts in Theoretical Computer Science 44.
Birkhoff, G., & Lipson, J. D. (1968). Heterogeneous algebras. Journal of Computational Theory, 8, 115–133.
Blackburn, P., de Rijke, M., & Venema, Y. (2000). Modal logic. Cambridge, UK: Cambridge University Press.
Chellas, B. F. (1980). Modal logic: An introduction. Cambridge University Press.
Doberkat, E. -E. (2010). Stochastic coalgebraic logic. Springer.
Dunn, J. M. (1991). Gaggle theory: An abstraction of Galois connections and residuation with applications to negation, implication, and various logical operators. In J. van Eijck (Ed.), Logics in AI: European workshop JELIA ’90, Lecture notes in computer science (Vol. 478, pp. 31–51). Berlin: Springer.
Dunn, J. M., & Hardegree, G. M. (2001). Algebraic methods in philosophical logic, Oxford logic guides (Vol. 41). Oxford, UK: Oxford University Press.
Fagin, R., Halpern, J. Y., Moses, Y., & Vardi, M. (1995). Reasoning about knowledge. MIT Press.
Freyd, P. J., & Scedrov, A. (1990). Categories, allegories. North-Holland, Amsterdam.
Gabbay, D. (1999). Fibring logics. Oxford University Press.
Goguen, J. A., & Burstall, R. M. (1985). Institutions: Abstract model theory for specification and programming. CSLI Research Reports, 85–30, 1–73.
Goguen, J. A., & Meseguer, J. (1982). Security policies and security models. In Proceedings of the 1982 IEEE Symposium on Security and Privacy (pp. 11–20). IEEE Press.
Jacobs, B. (1999). Categorical logic and type theory. Springer.
Manes, E. G. (1976). Algebraic theories. Springer.
Moskowitz, I. S., Chang, L., & Newman, R. E. (2002). Capacity is the wrong paradigm. In Proceedings of New Security Paradigms Workshop, Sept. 23–26 (pp. 114–126). ACM Press.
Procter, A., Harrison, W. L., Graves, I., Becchi, M., & Allwein, G. (2015). Semantics driven hardware design, implementation, and verification with ReWire. In ACM SIGPLAN/SIGBED Conference on Languages, Compilers, Tools and Theory for Embedded Systems (LCTES) (pp. 1–10).
Rasga, J., Sernadas, A., & Sernadas, C. (2010). Importing logics. Studia Logica, 100, 545–581.
Sangiorgi, D. (2012). Introduction to bisimulation and coinduction. Cambridge University Press.
Sernadas, A., Sernadas, C., & Caleiro, C. (1999). Fibring of logics as a categorical construction. Journal of Logic and Computation, 9, 149–179.
Thomason, R. (1984). Combinations of tense and modality. Handbook of philosophical logic (pp. 135–165). Kluwer Academic Publishers.
van Benthem, J. (2000). Information transfer across Chu spaces. Logic Journal of the IGPL, 8(6), 719–731.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Allwein, G., Harrison, W.L. (2016). Distributed Modal Logic. In: Bimbó, K. (eds) J. Michael Dunn on Information Based Logics. Outstanding Contributions to Logic, vol 8. Springer, Cham. https://doi.org/10.1007/978-3-319-29300-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-29300-4_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-29298-4
Online ISBN: 978-3-319-29300-4
eBook Packages: Religion and PhilosophyPhilosophy and Religion (R0)