Probabilistic Process Algebra
Probabilistic Process Algebra is a formal computational framework within process algebra that extends traditional process calculi by incorporating probabilistic choice and stochastic behavior to model and analyze systems exhibiting randomness in state transitions and interactions.
83
Publications
3K
Citations
133
Authors
70
Institutions
Publications per year
2017–2026
5
Parents
83
Bisimulation for Labelled Markov Processes
Information and Computation · 2002 · 307 citations
Turning back time in Markovian process algebra
Peter G. Harrison · Theoretical Computer Science · 2003 · 123 citations
Suzana Andova · TU/e Research Portal · 2002 · 105 citations · Full text
1–5 of 83
133
6
h-index
5
h-index
5
h-index
4
h-index
3
h-index
1–5 of 133
70

Imperial College London
London, United Kingdom
9 h-index
21 publications
1.2K citations

University of Edinburgh
Edinburgh, United Kingdom
8 h-index
15 publications
519 citations

University of Twente
Enschede, The Netherlands
5 h-index
16 publications
255 citations
University of Castilla-La Mancha
Ciudad Real, Spain
4 h-index
14 publications
362 citations

University of Bologna
Bologna, Italy
4 h-index
6 publications
143 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
4 h-index
5 publications
167 citations
RWTH Aachen University
Aachen, Germany
4 h-index
4 publications
77 citations

McGill University
Montreal, Canada
3 h-index
6 publications
209 citations
1–8 of 70
6 publications · 323 citations
6
h-index
ENTCS · 6 publications · 167 citations
6
h-index
5 publications · 161 citations
5
h-index
3 publications · 79 citations
3
h-index
2 publications · 346 citations
2
h-index
1–5