Termination of processes

DOI10.1017/S0960129505004810zbMath1092.68069OpenAlexW2129381550MaRDI QIDQ5466792

Davide Sangiorgi

Publication date: 22 May 2006

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129505004810

zbMATH Keywords

behavioural preorders

Mathematics Subject Classification ID

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

Related Items (8)

Eager functions as processes ⋮ Mobile Processes and Termination ⋮ Termination in a π-calculus with subtyping ⋮ Linear logical relations and observational equivalences for session-based concurrency ⋮ Typing termination in a higher-order concurrent imperative language ⋮ Termination in higher-order concurrent calculi ⋮ Ensuring termination by typability ⋮ Corecursion and Non-divergence in Session-Typed Processes

This page was built for publication: Termination of processes