A calculus of mobile processes, II
Information and Computation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
A calculus of communicating systems with label passing—ten years after
Proof, language, and interaction
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Semantics of Name and Value Passing
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Models for name-passing processes: interleaving and causal
Information and Computation
Comparing operational models of name-passing process calculi
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
A Congruence Format for Name-passing Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Labels from reductions: towards a general theory
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Efficient bisimilarities from second-order reaction semantics for π-calculus
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
| Hi-index | 0.00 |
The pi-calculus and its many variations have received much attention in the literature. We discuss the standard early labelled transition system (lts) and outline an approach which decomposes the system into two components, one of which is presented in detail. The advantages of using the decomposition include a more complete understanding of the treatment of bound outputs in Pi as well as an lts which is more robust with respect to the addition and removal of language features. The present paper serves as an overview of some of the techniques involved and some of the goals of the ongoing work.