Axiomatising Divergence

Authors:
Markus Lohrey;Pedro R. D'Argenio;Holger Hermanns
Affiliations:
-;-;-
Venue:
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Year:
2002

Citing 8
Cited 5

A complete axiomatisation for observational congruence of finite-state behaviours

Information and Computation
Bisimulation and divergence

Information and Computation
Process algebra

Process algebra
Termination, deadlock, and divergence

Journal of the ACM (JACM)
Branching time and abstraction in bisimulation semantics

Journal of the ACM (JACM)
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
The Linear Time - Branching Time Spectrum II

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

Axiomatising divergence

Information and Computation
On Convergence-sensitive Bisimulation and the Embedding of CCS in Timed CCS

Electronic Notes in Theoretical Computer Science (ENTCS)
Axiomatising divergence

Information and Computation
Interactive Markov chains: and the quest for quantified quality

Interactive Markov chains: and the quest for quantified quality
The value-passing calculus

Theories of Programming and Formal Methods

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper develops sound and complete axiomatisations for the divergence sensitive spectrum of weak bisimulation equivalence. The axiomatisations can be extended to a considerable fragment of the linear time - branching time spectrum with silent moves, partially solving an open problem posed in [5].