Juliani Karhumäki, Hermann Maurer, Grzegorz Rozenberg
1 Department of Computer Science, Faculty of Science, Aarhus University, Aarhus University2 Department of Computer Science, Science and Technology, Aarhus University3 unknown4 Department of Computer Science, Science and Technology, Aarhus University
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.
Lecture Notes in Computer Science: Colloquium in Honor of Arto Salomaa Graz, Austria, June 10-11, 1994 Proceedings, 1994, p. 289-306