Using session types for reasoning about boundedness in the \(\pi\)-calculus

DOI10.1007/s00236-019-00339-5zbMath1477.68180arXiv1709.00829OpenAlexW2971203178MaRDI QIDQ2216475

Hans Hüttel

Publication date: 16 December 2020

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.00829

Mathematics Subject Classification ID

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

Uses Software

• SLMC

Cites Work

• Unnamed Item
• On the expressiveness and decidability of higher-order process calculi
• A calculus of mobile processes. I
• A calculus of mobile processes. II
• Model checking mobile processes
• Subtyping for session types in the pi calculus
• On Duality Relations for Session Types
• A Theory of Name Boundedness
• On the Relationship between π-Calculus and Finite Place/Transition Petri Nets
• Forward Analysis of Depth-Bounded Processes
• Proving Liveness Properties of Concurrent Programs
• Foundations of Software Science and Computation Structures
• Fencing off go: liveness and safety for channel-based programming

This page was built for publication: Using session types for reasoning about boundedness in the \(\pi\)-calculus