A Well-behaved LTS for the Pi-calculus

DOI10.1016/J.ENTCS.2007.10.002zbMath1278.68223OpenAlexW1993543651MaRDI QIDQ2871826

Paweł Sobociński

Publication date: 10 January 2014

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.10.002

zbMATH Keywords

semanticslabelled transition systemsprocess calculipi-calculus

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 (1)

Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi

Cites Work

• Models for name-passing processes: Interleaving and causal
• A calculus of mobile processes. II
• Comparing operational models of name-passing process calculi
• Algebra and Coalgebra in Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Well-behaved LTS for the Pi-calculus