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
AbstractThis paper presents an equational axiomatization of bisimulation equivalence over the langua...
Prex iteration x is added to Basic Process Algebra with deadlock and empty process. We present a ni...
This paper presents an equational axiomatization of bisimulation equivalence over the language of Ba...
Prefix iteration is a variation on the original binary version of the Kleene star operation P*Q, obt...
AbstractPrefix iteration is a variation on the original binary version of the Kleene star operationP...
Fokkink ((1994) Inf. Process. Lett. 52: 333{337) has recently proposed a completeequational axiomati...
Prefix iteration is a variation on the original binary version of theKleene star operation P*Q, obta...
This paper studies the interaction of prefix iteration ¯ x with the silent step ø in the setting ...
We study equational axiomatizations of bisimulation equivalence for the language obtained by extendi...
AbstractWe study equational axiomatizations of bisimulation equivalence for the language obtained by...
We study equational axiomatizations of bisimulation equivalence for the language obtained by extendi...
AbstractWe study the divergent-sensitive spectrum of weak bisimulation equivalences in the setting o...
We study the divergent-sensitive spectrum of weak bisimulation equivalences in the setting of proces...
Prefix iteration is a variation on the original binary version of the Kleene star operation P*Q, obt...
Bergstra, Bethke and Ponse proposed an axiomatization for Basic Process Algebra extended with (binar...
AbstractThis paper presents an equational axiomatization of bisimulation equivalence over the langua...
Prex iteration x is added to Basic Process Algebra with deadlock and empty process. We present a ni...
This paper presents an equational axiomatization of bisimulation equivalence over the language of Ba...
Prefix iteration is a variation on the original binary version of the Kleene star operation P*Q, obt...
AbstractPrefix iteration is a variation on the original binary version of the Kleene star operationP...
Fokkink ((1994) Inf. Process. Lett. 52: 333{337) has recently proposed a completeequational axiomati...
Prefix iteration is a variation on the original binary version of theKleene star operation P*Q, obta...
This paper studies the interaction of prefix iteration ¯ x with the silent step ø in the setting ...
We study equational axiomatizations of bisimulation equivalence for the language obtained by extendi...
AbstractWe study equational axiomatizations of bisimulation equivalence for the language obtained by...
We study equational axiomatizations of bisimulation equivalence for the language obtained by extendi...
AbstractWe study the divergent-sensitive spectrum of weak bisimulation equivalences in the setting o...
We study the divergent-sensitive spectrum of weak bisimulation equivalences in the setting of proces...
Prefix iteration is a variation on the original binary version of the Kleene star operation P*Q, obt...
Bergstra, Bethke and Ponse proposed an axiomatization for Basic Process Algebra extended with (binar...
AbstractThis paper presents an equational axiomatization of bisimulation equivalence over the langua...
Prex iteration x is added to Basic Process Algebra with deadlock and empty process. We present a ni...
This paper presents an equational axiomatization of bisimulation equivalence over the language of Ba...