Executable behaviour and the -calculus (extended abstract)

zbMATH Open1433.68255arXiv1508.04850MaRDI QIDQ5216151FDOQ5216151

Authors: Bas Luttik, Fei Yang 

Publication date: 14 February 2020

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

Recommendations

• The \(\pi\)-calculus is behaviourally complete and orbit-finitely executable
• Reactive Turing machines
• On the executability of interactive computation
• Reactive Turing machines
• scientific article; zbMATH DE number 1420796

Mathematics Subject Classification ID

Other nonclassical models of computation (68Q09) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A behavioural theory for a \(\pi\)-calculus with preorders
• A well-behaved LTS for the pi-calculus (abstract)

This page was built for publication: Executable behaviour and the \(\pi \)-calculus (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5216151)