A Characterisation of Weak Bisimulation Congruence

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.

Saved in:
Bibliographic Details
Published inProcesses, Terms and Cycles: Steps on the Road to Infinity pp. 26 - 39
Main Author van Glabbeek, Rob J.
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2005
SeriesLecture Notes in Computer Science
Subjects
Equivalence Relation
Isomorphism Class
Proof Sketch
Semantic Context
Yield Root
Online AccessGet full text
ISBN354030911X
9783540309116
ISSN0302-9743
1611-3349
DOI10.1007/11601548_4

Cover

More Information
Summary: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.
ISBN:354030911X
9783540309116
ISSN:0302-9743
1611-3349
DOI:10.1007/11601548_4