A thesis for interaction

DOI10.1016/J.TCS.2021.10.001MaRDI QIDQ2055962zbMATH OpenOpenAlexFDO

Authors Yuxi Fu

Publication date 1 December 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2021.10.001

zbMATH Keywords

expressivenessbisimulationprocess calculustheory of interaction

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Theory of interaction
• scientific article; zbMATH DE number 1759398
• Interactive foundations of computing
• A theory of interactive computation
• scientific article; zbMATH DE number 1759503

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 3714941 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 7204939 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A calculus of mobile processes. II
• A theory of communicating processes with value passing
• A theory of encodings and expressiveness (extended abstract)
• A theory of higher order communicating systems
• A theory of interactive computation
• Algebraic theories for name-passing calculi
• Barbed bisimulation
• Branching Bisimilarity with Explicit Divergence
• Branching time and abstraction in bisimulation semantics
• Comparing communication primitives via their relative expressive power
• Computability by Probabilistic Turing Machines
• Computation tree logic with deadlock detection
• Computational Complexity of Probabilistic Turing Machines
• Decoding choice encodings
• Distinguishing and relating higher-order and first-order processes by expressiveness
• Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
• From \(\pi \)-calculus to higher-order \(\pi \)-calculus -- and back
• Functions as processes
• General recursive functions of natural numbers
• How We Think of Computing Today
• Mobile ambients
• Non-deterministic structures of computation
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On the expressiveness of interaction
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Reactive Turing machines
• Symbolic bisimulations
• Tau laws for pi calculus
• The Value-Passing Calculus
• The \(\pi\)-calculus is behaviourally complete and orbit-finitely executable
• The \(\pi\)-calculus: A theory of mobile processes
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The universal process
• Theory of interaction
• Towards a Unified Approach to Encodability and Separation Results for Process Calculi
• Turing machines, transition systems, and interaction
• Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
• What is a ``good encoding of guarded choice?

Cited in

(1)

• scientific article; zbMATH DE number 7204939 (Why is no real title available?)

This page was built for publication: A thesis for interaction

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