From Programs to Games: Invariance and Safety for Bisimulation

Authors:
Marc Pauly
Affiliations:
-
Venue:
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Year:
2000

Citing 8
Cited 2

The logic of games and its applications

Selected papers of the international conference on "foundations of computation theory" on Topics in the theory of computation
Logics of programs

Handbook of theoretical computer science (vol. B)
Basic modal logic

Handbook of logic in artificial intelligence and logic programming (vol. 1)
Games and winning strategies

Information Processing Letters - Special issue on the calculational method
Refinement Calculus: A Systematic Introduction

Refinement Calculus: A Systematic Introduction
On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
The Modal mu-calculus Alternation Hierarchy is Strict

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Modal logic, transition systems and processes

Modal logic, transition systems and processes

Game Quantification Patterns

ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Categories of coalgebraic games

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bisimulation is generalized from process models to game models which are described using Game Logic (GL), a logic which extends Propositional Dynamic Logic by an additional operator dual which allows for the construction of complex 2-player games. It is shown that bisimilar states satisfy the same GL-formulas (invariance), and that an atomic bisimulation can be lifted to non-atomic GL-games (safety). Over process models, GL forms a highly expressive fragment of the modal µ-calculus, and within first-order logic,the game operations of GL are complete: they suffice to construct all first-order definable games which are monotonic and safe for bisimulation.