Verification of an alternating bit protocol by means of process algebra
Proceedings of the International Spring School on Mathematical method of specification and synthesis of software systems '85
Another look at abstraction in process algebra
14th International Colloquium on Automata, languages and programming
Structured operational semantics and bisimulation as a congruence
Information and Computation
A complete equational axiomatization for prefix iteration
Information Processing Letters
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Two Complete Axiom Systems for the Algebra of Regular Events
Journal of the ACM (JACM)
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
A Complete Characterization of Termination of Op 1q - 1r Os
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
A General Conservative Extension Theorem in Process Algebra
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
| Hi-index | 0.00 |
This paper studies the interaction of prefix iteration with the silent step in the setting of branching bisimulation. We present a finite equational axiomatization for Basic Process Algebra with deadlock, empty process and the silent step, extended with prefix iteration, and prove that this axiomatization is complete with respect to rooted branching bisimulation equivalence.