On the complete axiomatization for prefix iteration modulo observation congruence

Authors:
Taolue Chen;Tingting Han;Jian Lu
Affiliations:
CWI, Department of Software Engineering Amsterdam, The Netherlands and State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing, Jiangsu, P.R. China;State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing, Jiangsu, P.R. China;State Key Laboratory of Novel Software Technology, Nanjing University, Nanjing, Jiangsu, P.R. China
Venue:
Acta Cybernetica
Year:
2006

Citing 11
Cited 1

A complete axiomatisation for observational congruence of finite-state behaviours

Information and Computation
A complete equational axiomatization for prefix iteration

Information Processing Letters
Axiomatizing prefix iteration with silent steps

Information and Computation
Branching time and abstraction in bisimulation semantics

Journal of the ACM (JACM)
A complete axiomatization for prefix iteration in branching bisimulation

Fundamenta Informaticae
A complete equational axiomatization for MPA with string iteration

Theoretical Computer Science
Communication and Concurrency

Communication and Concurrency
An Equational Axiomatization of Observation Congruence for Prefix Iteration

AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
A New Strategy for Proving omega-Completeness applied to Process Algebra

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
Tau laws for pi calculus

Theoretical Computer Science

Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Prefix iteration is a variation on the original binary version of the Kleene star operation P*Q, obtained by restricting the first argument to be an atomic action. Aceto and Ingólfsdóttir provided an axiom system for observation congruence over basic CCS with prefix iteration. However hitherto the only direct completeness proof given for such a system is very long and technical. In this paper, we provide a new proof for the completeness of the axiom system in [3], which is a considerable simplification comparing to the original proof. Thus the open problem to find a direct completeness proof is closed.