Simulation Preorder is a binary relation between processes in process algebra that belongs to the class of behavioral preorders, distinguished by its requirement that for one process to simulate another, every action transition of the latter must be matched by a corresponding transition sequence in the former, preserving observable behavior.
29
Publications
962
Citations
51
Authors
40
Institutions
Publications per year
2017–2026
1
Parents
Publications
29
An efficiency preorder for processes
S. Arunkumar, Matthew Hennessy · Acta Informatica · 1992 · 117 citations
Agriculture, Industrial Engineering, Business Process Management +3
Doron Bustan, Orna Grümberg · ACM Transactions on Computational Logic · 2003 · 95 citations
Compositional testing preorders for probabilistic processes
Bengt Jönsson, Wang Yi · 2002 · 84 citations
1–5 of 29
Authors
51
- MH
4
h-index
- MP
3
h-index
- DD
3
h-index
- RM
3
h-index
- FV
2
h-index
1–5 of 51
Institutions
40
Aalborg University
Aalborg, Denmark
3 h-index
3 publications
32 citations
Universidad Complutense de Madrid
Madrid, Spain
3 h-index
8 publications
105 citations
Trinity College Dublin
Dublin, Ireland
2 h-index
3 publications
165 citations
IMDEA Software Institute
Pozuelo de Alarcón, Spain
2 h-index
3 publications
37 citations
University of Edinburgh
Edinburgh, United Kingdom
2 h-index
4 publications
78 citations
University of Mannheim
Mannheim, Germany
2 h-index
2 publications
62 citations
Shanghai Jiao Tong University
Shanghai, China
2 h-index
2 publications
124 citations
UNSW Sydney
Sydney, Australia
2 h-index
6 publications
372 citations
1–8 of 40
Venues
- Logical Methods in Computer Science
LMCS · 5 publications · 131 citations
5
h-index
- BRICS Report Series
2 publications · 21 citations
2
h-index
- Electronic Notes in Theoretical Computer Science
ENTCS · 2 publications · 32 citations
2
h-index
- Theoretical Computer Science
2 publications · 70 citations
2
h-index
- Fundamenta Informaticae
1 publications · 13 citations
1
h-index
1–5