Author:
Aceto Luca,Ingólfsdóttir Anna
Abstract
Fokkink ((1994) Inf. Process. Lett. 52: 333{337) has recently proposed a complete<br />equational axiomatization of strong bisimulation equivalence for MPA_delta^*(A_tau),<br />i.e., the language obtained by extending Milner's basic CCS with prefix iteration.<br />Prefix iteration is a variation on the original binary version of the Kleene star operation<br />p*q obtained by restricting the first argument to be an atomic action. In this<br />paper, we extend Fokkink's results to a setting with the unobservable action by<br />giving a complete equational axiomatization of Milner's observation congruence over<br />MPA_delta^*(A_tau ). <br />The axiomatization is obtained by extending Fokkink's axiom system<br />with two of Milner's standard tau-laws and the following three equations that describe<br />the interplay between the silent nature of tau and prefix iteration:<br />tau . x = tau*x<br />a*(x+tau.y) = a*(x+tau.y + a.y)<br />tau.(a*x) = a*(tau.a*x) .<br />Using a technique due to Groote, we also show that the resulting axiomatization is<br />omega-complete, i.e., complete for equality of open terms.<br />AMS Subject Classification (1991): 68Q40, 68Q42.<br />CR Subject Classification (1991): D.3.1, F.3.2, F.4.2.<br />Keywords and Phrases: Minimal Process Algebra, prefix iteration, equational<br />logic, omega-completeness, observation congruence.
Publisher
Det Kgl. Bibliotek/Royal Danish Library
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献