Branching time and orthogonal bisimulation equivalence

Authors:
Jan A. Bergstra;Alban Ponse;Mark B. van der Zwaag
Affiliations:
Programming Research Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, Netherlands and Department of Philosophy, Utrecht University, Heidelberglaan 8, 3584 CS Utrecht, Netherlands;Programming Research Group, University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, Netherlands;Department of Computer Science, University of Nijmegen, Toernooiveld 1, 6525 ED Nijmegen, Netherlands
Venue:
Theoretical Computer Science
Year:
2003

Citing 20
Cited 6

Algebraic laws for nondeterminism and concurrency

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

Theoretical Computer Science
Process algebra

Process algebra
Three logics for branching bisimulation

Journal of the ACM (JACM)
Concrete process algebra

Handbook of logic in computer science (vol. 4)
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)
Modal and temporal logics for processes

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Register-machine based processes

Journal of the ACM (JACM)
Communication and Concurrency

Communication and Concurrency
Computer Networks

Computer Networks
A Calculus of Communicating Systems

A Calculus of Communicating Systems
Introduction to Process Algebra

Introduction to Process Algebra
Handbook of Process Algebra

Handbook of Process Algebra
A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Another Look at Abstraction in Process Algebra (Extended Abstract)

ICALP '87 Proceedings of the 14th International Colloquium, on Automata, Languages and Programming
The Linear Time - Branching Time Spectrum II

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
A Modal Characterisation of Observable Machine-Behaviour

CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Computation: finite and infinite machines

Computation: finite and infinite machines

The compression structure of a process

Information Processing Letters
Branching Bisimulation Congruence for Probabilistic Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
On the Difficulties of Concurrent-System Design, Illustrated with a 2×2 Switch Case Study

FM '09 Proceedings of the 2nd World Congress on Formal Methods
The compression structure of a process

Information Processing Letters
Branching bisimulation congruence for probabilistic systems

Theoretical Computer Science
Sigref: a symbolic bisimulation tool box

ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis

Quantified Score

Hi-index	5.24

Visualization

Abstract

We propose a refinement of branching bisimulation equivalence that we call orthogonal bisimulation equivalence. Typically, internal activity (the performance of τ-steps) may be compressed, but not completely discarded. Hence, a process with τ-steps cannot be equivalent to one without τ-steps. Also, we present a modal characterization of orthogonal bisimulation equivalence. This equivalence is a congruence for ACP extended with abstraction and priority operators. We provide a complete axiomatization, and describe some expressiveness results. Finally, we present the verification of a PAR protocol that is specified with use of priorities.