The equational theory of prebisimilarity over basic CCS with divergence

Authors:
Luca Aceto;Silvio Capobianco;Anna Ingolfsdottir;Bas Luttik
Affiliations:
School of Computer Science, Reykjavík University, Iceland;School of Computer Science, Reykjavík University, Iceland;School of Computer Science, Reykjavík University, Iceland;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, The Netherlands
Venue:
Information Processing Letters
Year:
2008

Citing 11
Cited 1

Bisimulation and divergence

Information and Computation
A domain equation for bisimulation

Information and Computation
Termination, deadlock, and divergence

Journal of the ACM (JACM)
Bisimulation can't be traced

Journal of the ACM (JACM)
CPO models for compact GSOS languages

Information and Computation
A characterization of finitary bisimulation

Information Processing Letters
Communication and Concurrency

Communication and Concurrency
Algebraic Theory of Processes

Algebraic Theory of Processes
A New Strategy for Proving omega-Completeness applied to Process Algebra

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
A Modal Characterisation of Observable Machine-Behaviour

CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
A Term Model for CCS

MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science

Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper studies the equational theory of prebisimilarity, a bisimulation-based preorder introduced by Hennessy and Milner in the early 1980s, over basic CCS with the divergent process @W. It is well known that prebisimilarity affords a finite ground-complete axiomatization over this language; this study proves that this ground-complete axiomatization is also complete in the presence of an infinite set of actions. Moreover, in sharp contrast to this positive result, it is shown that prebisimilarity is not finitely based over basic CCS with the divergent process @W when the set of actions is finite and nonempty.