On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A typed language for distributed mobile processes (extended abstract)
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus for cryptographic protocols
Information and Computation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Theoretical Computer Science
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Asynchronous process calculi: the first-and higher-order paradigms
Theoretical Computer Science - Special issues on models and paradigms for concurrency
Information Processing Letters
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Nomadic Pict: Language and Infrastructure Design for Mobile Agents
IEEE Concurrency
ECOOP '94 Proceedings of the 8th European Conference on Object-Oriented Programming
Notes on Nominal Calculi for Security and Mobility
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Mobile Processes: A Commented Bibliography
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Probabilistic Asynchronous pi-Calculus
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
On Asynchronous Communication Semantics
ECOOP '91 Proceedings of the Workshop on Object-Based Concurrent Computing
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
On asynchrony in name-passing calculi
Mathematical Structures in Computer Science
Theoretical Computer Science - Special issue: Computational systems biology
Using the π-calculus for formalizing workflow patterns
BPM'05 Proceedings of the 3rd international conference on Business Process Management
Comparing communication primitives via their relative expressive power
Information and Computation
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A Look Around the Corner: The Pi-Calculus
Transactions on Petri Nets and Other Models of Concurrency II
On the expressiveness of interaction
Theoretical Computer Science
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
| Hi-index | 0.00 |
Almost 30 years ago, the research on process calculi gained a lot of momentum with the invention of ACP, CCS and CSP. Later on, but also already 20 years ago, researchers started to consider so-called mobile variants of process calculi, in which communication channels were themselves treated as the exchanged data. The original Pi us arose out of a reformulation and extension of CCS. In turn, it boosted the invention and study of a whole zoo of further process calculi. In this tutorial, we provide a bird's-eye view on the jungle of results, techniques and subtleties about mobile process calculi. Next to a rough overview on the zoo of calculi, this includes the coverage of both semantic and pragmatic aspects, ranging from notions of equivalence and expressiveness to challenging application domains.