A characterisation of weak bisimulation congruence

Authors:
Rob J. van Glabbeek
Affiliations:
National ICT Australia and School of Computer Science and Engineering, The University of New South Wales
Venue:
Processes, Terms and Cycles
Year:
2005

Citing 5
Cited 2

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
On the consistency of Koomen's fair abstraction rule

Theoretical Computer Science
Operational and algebraic semantics of concurrent processes

Handbook of theoretical computer science (vol. B)
Branching time and abstraction in bisimulation semantics

Journal of the ACM (JACM)
The Linear Time - Branching Time Spectrum II

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory

Axiomatizing weak ready simulation semantics over BCCSP

ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Liveness, fairness and impossible futures

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows that weak bisimulation congruence can be characterised as rooted weak bisimulation equivalence, even without making assumptions on the cardinality of the sets of states or actions of the processes under consideration.