LP-1997-05: Bisimulation and Bounded Bisimulation

LP-1997-05: Gerbrandy, Jelle (1997) Bisimulation and Bounded Bisimulation. [Report]

[img] Text (Full Text)
LP-1997-05.text.ps.gz

Download (43kB)
[img] Text (Abstract)
LP-1997-05.abstract.txt

Download (1kB)

Abstract

In this paper the notion of bounded bisimulation is introduced to explore connections between work on Kripke models, non­well­founded sets and knowledge structures. The paper is organized as follows. The next section contains definitions of bisimulation and bounded bisimulation on Kripke models, which are the core notions in this paper. The next two sections contain definitions of non­well­founded models for modal logic, and of knowledge structures. Both of these have been proposed as alternatives to Kripke semantics. It is shown how these models can be seen as representing bisimulation classes and bounded bisimulation classes of Kripke models respectively. In the two sections after that we show how bounded bisimulation can be characterized by certain fragments of infinitary modal logic and by Ehrenfeucht games. The last section contains some examples of results proven by different authors in different contexts and shows how they can be seen as closely related using the notions introduced in this paper.

Item Type: Report
Report Nr: LP-1997-05
Series Name: Logic, Philosophy and Linguistics (LP)
Year: 1997
Date Deposited: 12 Oct 2016 14:40
Last Modified: 12 Oct 2016 14:40
URI: https://eprints.illc.uva.nl/id/eprint/1255

Actions (login required)

View Item View Item