Resource bisimilarity and graded bisimilarity coincide

Authors:
Luca Aceto;Anna Ingolfsdottir;Joshua Sack
Affiliations:
ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland;ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland;ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland
Venue:
Information Processing Letters
Year:
2010

Citing 8
Cited 0

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Terminal coalgebras in well-founded set theory

Theoretical Computer Science
Models of nondeterministic regular expressions

Journal of Computer and System Sciences
Modal logic

Modal logic
Communication and Concurrency

Communication and Concurrency
Graded Modalities and Resource Bisimulation

Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Expressivity of coalgebraic modal logic: The limits and beyond

Theoretical Computer Science
Modal Logics are Coalgebraic1

The Computer Journal

Quantified Score

Hi-index	0.89

Visualization

Abstract

Resource bisimilarity has been proposed in the literature on concurrency theory as a notion of bisimilarity over labeled transition systems that takes into account the number of choices that a system has. Independently, g-bisimilarity has been defined over Kripke models as a suitable notion of bisimilarity for graded modal logic. This note shows that these two notions of bisimilarity coincide over image-finite Kripke frames.