Counting nondeterministic computations
From MaRDI portal
Publication:2055958
DOI10.1016/j.tcs.2021.08.022zbMath1491.68125MaRDI QIDQ2055958
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.08.022
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68R10: Graph theory (including graph drawing) in computer science
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Cites Work
- Bisimulation and divergence
- Theory of interaction
- On the expressiveness of interaction
- Comparing communication primitives via their relative expressive power
- A calculus of mobile processes. II
- Axiomatising divergence
- Branching Bisimilarity with Explicit Divergence
- Termination, deadlock, and divergence
- Origins of Recursive Function Theory
- Barbed bisimulation
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item