Thumbnail
Access Restriction
Subscribed

Author Bergstra, Jan A. ♦ Ponse, Alban
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2001
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Bisimulation equivalence ♦ Kleene star ♦ Computability ♦ Concurrency ♦ Expressivity ♦ Iteration ♦ Process algebra ♦ Push-down operation
Abstract We study extensions of the process algebra axiom system $\textbf{ACP}$ with two recursive operations: the binary Kleene star $^{*},$ which is defined by $x^{*}y$ = $x(x^{*}y$ + $\textit{y},$ and the $\textit{push-down}$ operation $^{$},$ defined by $x^{$}y$ = $x((x^{$}y)(x^{$}y))$ + $\textit{y}.$ In this setting it is easy to represent register machine computation, and an equational theory results that is not decidable. In order to increase the expressive power, abstraction is then added: with rooted branching bisimulation equivalence each computable process can be expressed, and with rooted ô-bisimilarity each semi-computable process that initially is finitely branching can be expressed. Moreover, with abstraction and a finite number of auxiliary actions these results can be obtained without binary Kleene star. Finally, we consider two alternatives for the push-down operation. Each of these gives rise to similar results.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2001-11-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 48
Issue Number 6
Page Count 35
Starting Page 1207
Ending Page 1241


Open content in new tab

   Open content in new tab
Source: ACM Digital Library