A thesis for interaction

DOI10.1016/J.TCS.2021.10.001OpenAlexW3207567396MaRDI QIDQ2055962FDOQ2055962

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

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

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)

Cites Work

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

Cited In (1)

• Title not available (Why is that?)

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)