Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Resource bisimilarity and graded bisimilarity coincide$ , Anna Ingolfsdottir, Joshua Sack
 

Summary: Resource bisimilarity and graded bisimilarity coincide$
Luca Aceto
, Anna Ingolfsdottir, Joshua Sack
ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland
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. Indepen-
dently, 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.
Keywords: Concurrency, resource bisimilarity, graded bisimilarity, graded modal logic, Kripke frames,
coalgebras
1. Introduction
In the setting of concurrency theory, resource
bisimilarity has been defined over labeled transition
systems in [3, 4] in order to take into account the
number of choices that a system has. Intuitively,
unlike ordinary bisimilarity [12], resource bisimilar-
ity relates two processes only if their behaviors un-
fold to isomorphic synchronization trees. (As re-
marked in the conclusions of [4], resource bisimi-

  

Source: Aceto, Luca - School of Computer Science, Reykjavík University

 

Collections: Mathematics; Computer Technologies and Information Sciences