Download:
|
by Wan Fokkink, Hans Zantema
ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1995/1995-10.ps.gz
Add To MetaCart
Abstract:
x is added to Basic Process Algebra with deadlock and empty process. We present a finite equational axiomatization for this process algebra, and we prove that this axiomatization is complete with respect to strong bisimulation equivalence. This result is a mild generalization of a similar result in the setting of basic CCS in Fokkink (1994b). To obtain this completeness result, we set up a rewrite system, based on the axioms. In order to prove that this rewrite system is terminating modulo AC of the +, we generalize a termination theorem from Zantema and Geser (1994) to the setting of rewriting modulo equations. Finally, we show that
Citations
|
579
|
Term rewriting systems
– Klop
- 1992
|
|
541
|
Concurrency and automata on infinite sequences
– Park
- 1981
|
|
302
|
Process algebra for synchronous communication
– Bergstra, Klop
- 1984
|
|
257
|
Representation of events in nerve nets and finite automata
– Kleene
- 1956
|
|
185
|
Structured operational semantics and bisimulation as a congruence
– Groote, Vaandrager
- 1992
|
|
168
|
Real time process algebra
– Baeten, Bergstra
- 1991
|
|
110
|
A congruence theorem for structured operational semantics with predicates and negative premises
– Verhoef
- 1995
|
|
101
|
A Complete Inference System for a Class of Regular Behaviours
– Milner
- 1984
|
|
54
|
Process algebra with iteration and nesting
– Bergstra, Bethke, et al.
- 1994
|
|
34
|
Dummy elimination: Making termination easier
– Ferreira, Zantema
|
|
33
|
Termination by completion. Applicable Algebra
– Bellegarde, Lescanne
- 1990
|
|
32
|
Basic process algebra with iteration: Completeness of its equational axioms
– Fokkink, Zantema
- 1994
|
|
23
|
A term model for synchronous processes
– Hennessy
- 1981
|
|
21
|
A complete equational axiomatization for prefix iteration
– Fokkink
- 1994
|
|
16
|
The tyft/tyxt format reduces to tree rules
– Fokkink
- 1994
|
|
14
|
Extending process algebra with the empty process
– KOYMANS, VRANCKEN
- 1985
|
|
5
|
A complete equational axiomatization for prefix iteration with silent steps
– Aceto, Ingólfsdóttir
- 1995
|
|
5
|
A complete axiomatization for prefix iteration in branching bisimulation
– Fokkink
- 1996
|
