$\pi$-calculus, internal mobility, and agent-passing calculi

DOI10.1016/0304-3975(96)00075-8zbMath0874.68103OpenAlexW2001299902MaRDI QIDQ671684

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(96)00075-8

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Eager functions as processes ⋮ Tau laws for pi calculus ⋮ Probabilistic and nondeterministic aspects of anonymity ⋮ Nominal SOS ⋮ Linear forwarders ⋮ Name-passing calculi: from fusions to preorders and types ⋮ A functional presentation of pi calculus ⋮ Unnamed Item ⋮ Models for name-passing processes: Interleaving and causal ⋮ Strong normalisation in the $\pi$-calculus ⋮ The name discipline of uniform receptiveness (extended abstract) ⋮ Order algebras: a quantitative model of interaction ⋮ Some congruence properties for $\pi$-calculus bisimilarities ⋮ Symmetries and Dualities in Name-Passing Process Calculi ⋮ HOCore in Coq ⋮ A behavioural theory for a $\pi$-calculus with preorders ⋮ Distinguishing and relating higher-order and first-order processes by expressiveness ⋮ Bisimulation congruence of $\chi$-calculus ⋮ Theory of interaction ⋮ A fully abstract model for the $\pi$-calculus. ⋮ Separating Sessions Smoothly ⋮ On the expressiveness and decidability of higher-order process calculi ⋮ Unnamed Item ⋮ Choreographies, logically ⋮ Unnamed Item ⋮ Variations on mobile processes ⋮ The name discipline of uniform receptiveness ⋮ A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus ⋮ Linear logical relations and observational equivalences for session-based concurrency ⋮ Modelling patterns of gene regulation in the bond-calculus ⋮ Tutorial on separation results in process calculi via leader election problems ⋮ Denotational semantics of channel mobility in UTP-CSP ⋮ Free-algebra models for the $\pi $-calculus ⋮ The $C_\pi$-calculus: a model for confidential name passing ⋮ On the expressiveness of interaction ⋮ Typed event structures and the linear $\pi $-calculus ⋮ First–order Semantics for Higher–order Processes ⋮ Linear logic propositions as session types ⋮ Leader election in rings of ambient processes ⋮ A randomized encoding of the $\pi$-calculus with mixed choice ⋮ Fundamentals of session types ⋮ On the relative expressiveness of higher-order session processes ⋮ Unnamed Item ⋮ Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators ⋮ Linearity and bisimulation ⋮ On the Relative Expressiveness of Higher-Order Session Processes ⋮ Unnamed Item ⋮ Event structures for the reversible early internal $\pi$-calculus ⋮ On parameterization of higher-order processes ⋮ The λ-calculus in the π-calculus ⋮ On the expressiveness of internal mobility in name-passing calculi ⋮ Constructing weak simulations from linear implications for processes with private names ⋮ Unnamed Item ⋮ Mechanized metatheory revisited ⋮ Encoding Generic Judgments ⋮ Coverability Synthesis in Parametric Petri Nets ⋮ Explicit fusions ⋮ An interpretation of CCS into ludics ⋮ Asynchronous process calculi: The first- and higher-order paradigms ⋮ On the expressiveness of π-calculus for encoding mobile ambients ⋮ Decoding choice encodings ⋮ Matching Systems for Concurrent Calculi ⋮ Probabilistic π-Calculus and Event Structures

Cites Work

\(\pi\)-calculus, internal mobility, and agent-passing calculi