Open AccessBisimulations, Games and Logic
Author(s) -
Mogens Nielsen,
Christian Clausen
Publication year - 1994
Publication title -
daimi pb
Language(s) - English
Resource type - Journals
eISSN - 2245-9316
pISSN - 0105-8517
DOI - 10.7146/dpb.v23i467.6940
Subject(s) - bisimulation , interleaving , concurrency , computer science , simple (philosophy) , range (aeronautics) , theoretical computer science , mathematics , programming language , engineering , philosophy , epistemology , aerospace engineering , operating system
In a recent paper by Joyal, Nielsen, and Winskel, bisimulation is defined in an abstract and uniform way across a wide range of different models for concurrency. In this paper, following a recent trend in theoretical computer science, we characterize their abstract definition game-theoretically and logically in a non-interleaving model. Our characterizations appear as surprisingly simple extensions of corresponding characterizations of interleaving bisimulation.