A \(\pi\)-calculus with explicit substitutions

DOI10.1016/S0304-3975(96)00063-1zbMath0874.68197MaRDI QIDQ1350998

Paola Quaglia, Ugo Montanari, Gian-Luigi Ferrari

Publication date: 27 February 1997

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

πI: A symmetric calculus based on internal mobility, On Beta-Binders Communications, Comparing the expressiveness of the \(\pi \)-calculus and CCS, On the Expressiveness of Pure Mobile Ambients, A CPS encoding of name-passing in higher-order mobile embedded resources, Explicit substitutions for \(\pi\)-congruences, On the expressiveness of internal mobility in name-passing calculi, Compositional SOS and beyond: A coalgebraic view of open systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symbolic bisimulations
• Modal logics for mobile processes
• Calculi for synchrony and asynchrony
• 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
• Process algebra for synchronous communication
• Algebraic laws for nondeterminism and concurrency
• Bisimulation can't be traced
• A π-calculus with explicit substitutions: The late semantics