The compression structure of a process

Authors:
Thuy Duong Vu
Affiliations:
Programming Research Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands
Venue:
Information Processing Letters
Year:
2005

Citing 6
Cited 0

Another look at abstraction in process algebra

14th International Colloquium on Automata, languages and programming
Branching time and abstraction in bisimulation semantics

Journal of the ACM (JACM)
The meaning of negative premises in transition system specifications

Journal of the ACM (JACM)
A Calculus of Communicating Systems

A Calculus of Communicating Systems
A Modal Characterisation of Observable Machine-Behaviour

CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Branching time and orthogonal bisimulation equivalence

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

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.