Executable behaviour and the -calculus (extended abstract)

MaRDI QIDQ5216151zbMATH OpenFDO

Authors Bas Luttik, Fei Yang

Publication date 14 February 2020

Full work available at URL https://arxiv.org/abs/1508.04850, http://eptcs.web.cse.unsw.edu.au/paper.cgi?ICE2015.5

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)

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

Cited in

(6)

• A well-behaved LTS for the pi-calculus (abstract)
• On the executability of interactive computation
• Sequential composition in the presence of intermediate termination (extended abstract)
• scientific article; zbMATH DE number 7243676 (Why is no real title available?)
• The \(\pi\)-calculus is behaviourally complete and orbit-finitely executable
• A behavioural theory for a \(\pi\)-calculus with preorders

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)