Variations on mobile processes
From MaRDI portal
Publication:1960530
DOI10.1016/S0304-3975(99)00037-7zbMath0930.68062MaRDI QIDQ1960530
Publication date: 12 January 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
A Categorical Model of the Fusion Calculus, A pure labeled transition semantics for the applied pi calculus, A functional presentation of pi calculus, Fair ambients, Theory of interaction, Bisimulation congruence of \(\chi\)-calculus, Testing congruence for mobile processes, Understanding the mismatch combinator in chi calculus, Tau laws for pi calculus, On the relative expressiveness of higher-order session processes, On the Relative Expressiveness of Higher-Order Session Processes, FROM COMPUTING TO INTERACTION: ON THE EXPRESSIVENESS OF ASYNCHRONOUS PI-CALCULUS, The λ-calculus in the π-calculus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- Symbolic bisimulations
- Computational interpretations of linear logic
- The lambda calculus, its syntax and semantics
- The chemical abstract machine
- A calculus of mobile processes. II
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Reaction graph
- On the expressiveness of internal mobility in name-passing calculi
- Plain CHOCS. A second generation calculus for higher order processes
- The lazy lambda calculus in a concurrency scenario
- Proofs as processes
- On the \(\pi\)-calculus and linear logic
- A theory of higher order communicating systems
- On reduction-based process semantics
- Interaction combinators
- Symmetric \(\pi\)-calculus
- Asynchronous process calculi: The first- and higher-order paradigms
- Objects in the \(\pi\)-calculus
- Algebraic theories for name-passing calculi
- A theory of bisimulation for the \(\pi\)-calculus
- Calculi for interaction
- *-Autonomous categories and linear logic
- Functions as processes
- A proof theoretical approach to communication
- From π-calculus to higher-order π-calculus — and back
- π-Calculus semantics of object-oriented programming languages
- Complete inference systems for weak bisimulation equivalences in the π-calculus
- Barbed bisimulation
- The Universe of Set Theory
- On bisimulations for the asynchronous π-calculus
