BASIC PROCESS ALGEBRA WITH ITERATION - COMPLETENESS OF ITS EQUATIONALAXIOMS

Authors
FOKKINK W ZANTEMA H
Citation
W. Fokkink et H. Zantema, BASIC PROCESS ALGEBRA WITH ITERATION - COMPLETENESS OF ITS EQUATIONALAXIOMS, Computer journal, 37(4), 1994, pp. 259-267
Citations number
17
Categorie Soggetti
Computer Sciences","Computer Science Hardware & Architecture
Journal title
Computer journal → ACNP
ISSN journal
00104620
Volume
37
Issue
4
Year of publication
1994
Pages
259 - 267
Database
ISI
SICI code
0010-4620(1994)37:4<259:BPAWI->2.0.ZU;2-Y
Abstract
Bergstra, Bethke and Ponse proposed an axiomatization for Basic Proces s Algebra extended with (binary) iteration. In this paper, we prove th at this axiomatization is complete with respect to strong bisimulation equivalence. To obtain this result, we will set up a term rewriting s ystem, based on the axioms, and prove that this term rewriting system is terminating, and that bisimilar normal forms are syntactically equa l module commutativity and associativity of the +.