Mobile Processes and Termination
From MaRDI portal
Recommendations
Cites work
- Ensuring termination by typability
- scientific article; zbMATH DE number 2084339 (Why is no real title available?)
- scientific article; zbMATH DE number 1231449 (Why is no real title available?)
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- scientific article; zbMATH DE number 1479607 (Why is no real title available?)
- scientific article; zbMATH DE number 2104617 (Why is no real title available?)
- Natural termination
- Proving termination with multiset orderings
- Strong normalisation in the \(\pi\)-calculus
- Termination in higher-order concurrent calculi
- Termination of processes
- The -calculus: A theory of mobile processes
- The name discipline of uniform receptiveness
Cited in
(7)- Termination in a -calculus with subtyping
- Termination in impure concurrent languages
- Linear logical relations and observational equivalences for session-based concurrency
- Termination in a \(\pi\)-calculus with subtyping
- Termination of processes
- Termination Analysis for the \pi -Calculus by Reduction to Sequential Program Termination
- Safe session-based concurrency with shared linear state
This page was built for publication: Mobile Processes and Termination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3184750)