Axiomatizing Flat Iteration

Details Axiomatizing Flat Iteration Axiomatizing Flat Iteration

1998-10-07

arxiv.org/abs/cs/9810008v1

Proc. CONCUR '97, Warsaw, Poland, July 1997 (A. Mazurkiewicz and J. Winkowski, eds.), LNCS 1243, Springer-Verlag, 1997, pp. 22

Computer Science

Logic in Computer Science

15 pages. LaTeX 2.09. Filename: flat.tex.gz. On A4 paper print with: dvips -t a4 -O -2.15cm,-2.22cm -x 1225 flat. For US lette

Scientific paper

Flat iteration is a variation on the original binary version of the Kleene star operation P*Q, obtained by restricting the first argument to be a sum of atomic actions. It generalizes prefix iteration, in which the first argument is a single action. Complete finite equational axiomatizations are given for five notions of bisimulation congruence over basic CCS with flat iteration, viz. strong congruence, branching congruence, eta-congruence, delay congruence and weak congruence. Such axiomatizations were already known for prefix iteration and are known not to exist for general iteration. The use of flat iteration has two main advantages over prefix iteration: 1.The current axiomatizations generalize to full CCS, whereas the prefix iteration approach does not allow an elimination theorem for an asynchronous parallel composition operator. 2.The greater expressiveness of flat iteration allows for much shorter completeness proofs. In the setting of prefix iteration, the most convenient way to obtain the completeness theorems for eta-, delay, and weak congruence was by reduction to the completeness theorem for branching congruence. In the case of weak congruence this turned out to be much simpler than the only direct proof found. In the setting of flat iteration on the other hand, the completeness theorems for delay and weak (but not eta-) congruence can equally well be obtained by reduction to the one for strong congruence, without using branching congruence as an intermediate step. Moreover, the completeness results for prefix iteration can be retrieved from those for flat iteration, thus obtaining a second indirect approach for proving completeness for delay and weak congruence in the setting of prefix iteration.

Affiliated with

Also associated with

No associations

Rating

Axiomatizing Flat Iteration does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Axiomatizing Flat Iteration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Axiomatizing Flat Iteration will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-508779