Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
A domain equation for bisimulation
Information and Computation
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
A calculus of mobile processes, I
Information and Computation
Turning SOS rules into equations
Information and Computation
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
A &pgr;-calculus with explicit substitutions
MFCS '94 Selected papers from the 19th international symposium on Mathematical foundations of computer science
Complete Inference Systems for Weak Bisimulation Equivalences in the pi-Calculus
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
The Weak Late pi-Calculus Semantics as Observation Equivalence
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
| Hi-index | 0.00 |
We show the coincidence of non-ground π-calculus and πξ-calculus, a CCS-like calculus that allows processes to be explicitly represented as temporary functions of input parameters, and as permanent functions of their free names. As intermediate results, strong and weak π-calculus full congruences are characterized as finitary closures of the corresponding &pi:-bisimilarities. In this paper we consider only late π-calculus, but all of the characterizations can be easily adapted to deal with non-ground semantics of the early family.