Categorical Interpretation of Modal Structures under Bisimulation

Nino Guallart

doi:10.2478/kjps-2019-0008

.blurhash-client-img { display: none !important; }

Categorical Interpretation of Modal Structures under Bisimulation

Kairos. Journal of Philosophy & Science

Volume 22 (2019): Issue 1 (December 2019)

By: Nino Guallart

Open Access

|Mar 2020

Read online

Abstract

In this work we summarise the concept of bisimulation, widely used both in computational sciences and in modal logic, that characterises modal structures with the same behaviour in terms of accessibility relations. Then, we offer a sketch of categorical interpretation of bisimulation between modal structures, which comprise both the structure and the valuation from a propositional language.

References

(1) Alechina, N., Mendler, M., De Paiva, V., & Ritter, E. (2001, September). Categorical and Kripke semantics for constructive S4 modal logic. En International Workshop on Computer Science Logic (pp. 292–307). Springer Berlin Heidelberg.10.1007/3-540-44802-0_21
Open DOI Search in Google Scholar Back to article
(2) Van Benthem, J. (1976). Modal correspondence theory [Ph.D. Thesis]. University of Amsterdam, Netherlands.
Search in Google Scholar Back to article
(3) Blackburn, P., De Rijke, M., & Venema, Y. (2001). Modal logic, volume 53 of Cambridge tracts in theoretical computer science.10.1017/CBO9781107050884
Open DOI Search in Google Scholar Back to article
(4) Van Ditmarsch, H., van Der Hoek, W., & Kooi, B. (2007). Dynamic epistemic logic (Vol. 337). Springer Science & Business Media.10.1007/978-1-4020-5839-4
Open DOI Search in Google Scholar Back to article
(5) Gerbrandy, J.D. (1999). Bisimulations on planet Kripke. ILLC Dissertation Series.
Search in Google Scholar Back to article
(6) Goranko, V., & Otto, M. (2007). 5 Model theory of modal logic. Studies in Logic and Practical Reasoning, 3, 249–329.10.1016/S1570-2464(07)80008-5
Open DOI Search in Google Scholar Back to article
(7) Hennessy, M., & Milner, R. (1980). On observing nondeterminism and concurrency. Automata, Languages and Programming, 299–309.10.1007/3-540-10003-2_79
Open DOI Search in Google Scholar Back to article
(8) Keller, R.M. (1976). Formal verification of parallel programs. Communications of the ACM, 19(7), 371–384.10.1145/360248.360251
Open DOI Search in Google Scholar Back to article
(9) Park, D. (1981). Concurrency and automata on infinite sequences. In Theoretical computer science (pp. 167–183). Springer Berlin Heidelberg.10.1007/BFb0017309
Open DOI Search in Google Scholar Back to article
(10) Sangiorgi, D. (2009). On the origins of bisimulation and coinduction. ACM Transactions on Programming Languages and Systems (TOPLAS), 31(4), 15.10.1145/1516507.1516510
Open DOI Search in Google Scholar Back to article
(11) Stirling, C. (2012). Bisimulation and logic. Sangiorgi and Rutten [24, Chapter 4], 173–196.10.1017/CBO9780511792588.005
Open DOI Search in Google Scholar Back to article
(12) Venema, Y. (2007). 6 Algebras and coalgebras. Studies in Logic and Practical Reasoning, 3, 331–426.10.1016/S1570-2464(07)80009-7
Open DOI Search in Google Scholar Back to article