Counting nondeterministic computations

DOI10.1016/J.TCS.2021.08.022zbMath1491.68125OpenAlexW3197978420MaRDI QIDQ2055958

Qizhe Yang, 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.08.022

zbMATH Keywords

divergencenondeterminismCCSbranching bisimulationC-graph

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Counting nondeterministic computations