On the decidability of process equivalen
✍
Mads Dam
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 994 KB
We present general results for showing process equivalences applied to the finite control fragment of the z-calculus decidable. Firstly, a Finite Reachability Theorem states that up to finite name spaces and up to a static normalisation procedure, the set of reachable agent expressions is finite. Se