Weak Bisimulation is a behavioural equivalence relation in process algebra that identifies processes whose observable actions, including internal (silent) transitions, can be matched modulo arbitrary sequences of invisible steps, differing from strong bisimulation by abstracting away from τ-actions.
159
Publications
6.3K
Citations
247
Authors
144
Institutions
Publications per year
2017–2026
14
Variants
Weak Bisimilarity
Parents
Publications
159
On Probabilistic Automata in Continuous Time
Christian Eisentraut, Holger Hermanns, Lijun Zhang · 2010 · 171 citations
The metric analogue of weak bisimulation for probabilistic processes
Josée Desharnais, Radha Jagadeesan, Vineet Gupta et al. · 2003 · 160 citations
1–5 of 159
Authors
247
- MH
5
h-index
- HH
5
h-index
- MB
5
h-index
- RD
4
h-index
- AJ
4
h-index
1–5 of 247
Institutions
144
University of Sussex
Brighton, United Kingdom
9 h-index
17 publications
592 citations
University of Pisa
Pisa, Italy
8 h-index
19 publications
616 citations
University of Bologna
Bologna, Italy
7 h-index
12 publications
568 citations
University of Edinburgh
Edinburgh, United Kingdom
6 h-index
10 publications
657 citations
Institute of Software
Beijing, China
5 h-index
5 publications
145 citations
Saarland University
Saarbrücken, Germany
5 h-index
8 publications
418 citations
Chinese Academy of Sciences
Beijing, China
5 h-index
5 publications
130 citations
University of Cambridge
Cambridge, United Kingdom
5 h-index
7 publications
169 citations
1–8 of 144
Venues
- Theoretical Computer Science
21 publications · 910 citations
16
h-index
- Information and Computation
16 publications · 990 citations
14
h-index
- Electronic Notes in Theoretical Computer Science
ENTCS · 17 publications · 404 citations
12
h-index
- Mathematical Structures in Computer Science
MSCS · 5 publications · 175 citations
5
h-index
- Logical Methods in Computer Science
LMCS · 4 publications · 143 citations
4
h-index
1–5