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

Authors

256

  1. LA
    Luca Aceto

    Aalborg University, Denmark

    7 publications · 241 citations

    7

    h-index

  2. GW
    Glynn Winskel

    University of Cambridge, United Kingdom

    7 publications · 500 citations

    7

    h-index

  3. MN
    Mogens Nielsen

    Aarhus University, Denmark

    5 publications · 369 citations

    5

    h-index

  4. PJ
    Petr Jančar

    VSB - Technical University of Ostrava, Czechia

    4 publications · 152 citations

    4

    h-index

  5. FV
    Frits Vaandrager

    Radboud University Nijmegen, Netherlands

    4 publications · 509 citations

    4

    h-index

1–5 of 256

Venues

  1. Information and Computation

    16 publications · 1.3K citations

    13

    h-index

  2. Theoretical Computer Science

    13 publications · 841 citations

    12

    h-index

  3. Electronic Notes in Theoretical Computer Science

    ENTCS · 9 publications · 171 citations

    9

    h-index

  4. BRICS Report Series

    5 publications · 101 citations

    5

    h-index

  5. Information Processing Letters

    4 publications · 108 citations

    4

    h-index

1–5