Mobile Processes and Termination

DOI10.1007/978-3-642-04164-8_13zbMath1253.68239OpenAlexW1573695342MaRDI QIDQ3184750

Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi

Publication date: 22 October 2009

Published in: Semantics and Algebraic Specification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04164-8_13

Mathematics Subject Classification ID

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

Related Items

Termination in a π-calculus with subtyping ⋮ Linear logical relations and observational equivalences for session-based concurrency

Uses Software

• TyPiCal

Cites Work

• Strong normalisation in the \(\pi\)-calculus
• Natural termination
• Termination in higher-order concurrent calculi
• The name discipline of uniform receptiveness
• Ensuring termination by typability
• Proving termination with multiset orderings
• Termination of processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item