Strong Bisimulation
Strong Bisimulation is a binary relation between states in a labelled transition system that belongs to the class of behavioural equivalences, differing from its siblings by requiring every action and resulting state transition of one process to be matched identically by the other, including silent or internal actions, thereby preserving the branching structure of computations without abstraction.
151
Publications
7.6K
Citations
256
Authors
156
Institutions
Publications per year
2017–2026
12
Parents
151
Branching time and abstraction in bisimulation semantics
Rob J. van Glabbeek, W. P. Weijland · Journal of the ACM · 1996 · 737 citations · Full text
André Joyal, Mogens Nielsen, Glynn Winskel · Information and Computation · 1996 · 269 citations
1–5 of 151
256
7
h-index
7
h-index
5
h-index
4
h-index
4
h-index
1–5 of 256
156

Aarhus University
Aarhus, Denmark
11 h-index
18 publications
1.1K citations
University of Sussex
Brighton, United Kingdom
8 h-index
12 publications
580 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
7 h-index
9 publications
380 citations

University of Amsterdam
Amsterdam, The Netherlands
6 h-index
8 publications
565 citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
6 h-index
11 publications
2.2K citations
University of Pennsylvania
Philadelphia, United States
6 h-index
11 publications
532 citations

University of Warsaw
Warsaw, Poland
5 h-index
8 publications
113 citations
University of Cambridge
Cambridge, United Kingdom
5 h-index
7 publications
218 citations
1–8 of 156
16 publications · 1.3K citations
13
h-index
13 publications · 841 citations
12
h-index
ENTCS · 9 publications · 171 citations
9
h-index
5 publications · 101 citations
5
h-index
4 publications · 108 citations
4
h-index
1–5