Abstract
This paper is about orthogonal bisimulation, a notion introduced by Bergstra, Ponse and van der Zwaag in 2003. Orthogonal bisimulation is a refinement of branching bisimulation, in which consecutive tau's (silent steps) can be compressed into one (but not zero) tau's. The main advantage of orthogonal bisimulation, compared to branching bisimulation, is that it combines better with priorities. This paper presents the notion of a compression structure of a process. It is proved that two processes are orthogonally bisimilar if and only if they have the same compression structure. Thus compression structure characterizes orthogonal bisimulation in the same way as branching structure (van Glabbeek, 1993) characterizes branching bisimulation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
