The Decidability of the Structural Congruence for Beta-binders
Electronic Notes in Theoretical Computer Science (ENTCS)
An exercise in structural congruence
Information Processing Letters
On the decidability and complexity of the structural congruence for beta-binders
Theoretical Computer Science
Relating state-based and process-based concurrency through linear logic (full-version)
Information and Computation
On the Relationship between η-Calculus and Finite Place/Transition Petri Nets
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
| Hi-index | 0.01 |
In the $\pi$-calculus with replication, a new structural congruence called “middle” congruence is investigated: a notion of structural equivalence of processes in which replication of a process is viewed as a potential rather than an actual infinite number of copies of the process, in the sense that copies are spawned at need rather than produced all at once. It is slightly weaker than standard congruence (which is also of the potential type) but stronger than the extended congruence investigated before by the authors (which is of the actual type). It is shown that middle congruence has the same desirable properties as extended congruence: it is decidable and it has a concrete multiset semantics. Thus, these properties do not depend on the distinction between potential and actual replication.