Skip Navigation

The Computer Journal 1994 37(4):259-267; doi:10.1093/comjnl/37.4.259
© 1994 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (21)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Fokkink, W.
Right arrow Articles by Zantema, H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Basic Process Algebra with Iteration: Completeness of its Equational Axioms

W. Fokkink1 * and H. Zantema2 §

1 CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands, 2 Utrecht University, Padualaan 14, 3508 TB Utrecht, The Netherlands

Bergstra, Bethke and Ponse proposed an axiomatization for Basic Process Algebra extended with (binary) iteration. In this paper, we prove that this axiomatization is complete with respect to strong bisimulation equivalence. To obtain this result, we will set up a term rewriting system, based on the axioms, and prove that this term rewriting system is terminating, and that bisimilar normal forms are syntactically equal modulo commutativity and associativity of the +.


* CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands

§ Utrecht University, Padualaan 14, 3508 TB Utrecht, The Netherlands


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.