A π-calculus with explicit substitutions: The late semantics

DOI10.1007/3-540-58338-6_81zbMath1493.68244OpenAlexW1502101334MaRDI QIDQ5096892

Ugo Montanari, Paola Quaglia, Gian-Luigi Ferrari

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_81

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Modelling and analysing neural networks using a hybrid process algebra, A \(\pi\)-calculus with explicit substitutions, A calculus of quality for robustness against unreliable communication, \(\pi\)-calculus, internal mobility, and agent-passing calculi

Cites Work

• Unnamed Item
• Unnamed Item
• Modal logics for mobile processes
• Higher-level synchronising devices in Meije-SCCS
• A calculus of communicating systems
• A calculus of mobile processes. II
• Structured operational semantics and bisimulation as a congruence
• Turning SOS rules into equations
• A theory of bisimulation for the \(\pi\)-calculus
• Recursive functions of symbolic expressions and their computation by machine, Part I
• Algebraic laws for nondeterminism and concurrency
• Bisimulation can't be traced