A thesis for interaction
From MaRDI portal
Publication:2055962
DOI10.1016/j.tcs.2021.10.001OpenAlexW3207567396MaRDI QIDQ2055962
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reactive Turing machines
- Symbolic bisimulations
- Turing machines, transition systems, and interaction
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Theory of interaction
- On the expressiveness of interaction
- Comparing communication primitives via their relative expressive power
- A calculus of mobile processes. II
- A theory of communicating processes with value passing
- A theory of higher order communicating systems
- Mobile ambients
- A theory of encodings and expressiveness (extended abstract)
- What is a ``good encoding of guarded choice?
- Tau laws for pi calculus
- Algebraic theories for name-passing calculi
- 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
- General recursive functions of natural numbers
- The Value-Passing Calculus
- Branching Bisimilarity with Explicit Divergence
- Computation Tree Logic with Deadlock Detection
- How We Think of Computing Today
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi
- Functions as processes
- Computational Complexity of Probabilistic Turing Machines
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Branching time and abstraction in bisimulation semantics
- A Theory of Interactive Computation
- From π-calculus to higher-order π-calculus — and back
- Barbed bisimulation
- Computability by Probabilistic Turing Machines
- Non-deterministic structures of computation
- Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Decoding choice encodings
This page was built for publication: A thesis for interaction
