Non-deterministic structures of computation

DOI10.1017/S0960129514000012MaRDI QIDQ5740658zbMATH OpenOpenAlexFDO

Authors Yuxi Fu

Publication date 27 July 2016

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129514000012

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Counting nondeterministic computations
• scientific article; zbMATH DE number 4024793
• scientific article; zbMATH DE number 4113946
• Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes
• Counting Paths: Nondeterminism as Linear Algebra

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• A calculus of mobile processes. I
• A calculus of mobile processes. II
• A complete axiomatisation for observational congruence of finite-state behaviours
• A complete inference system for a class of regular behaviours
• A theory of communicating processes with value passing
• An Unsolvable Problem of Elementary Number Theory
• Axiomatising divergence
• Bisimulation and divergence
• Bisimulation can't be traced
• Calculi for synchrony and asynchrony
• Computability and λ-definability
• Formal Reductions of the General Combinatorial Decision Problem
• Functions as processes
• General recursive functions of natural numbers
• Higher-level synchronising devices in Meije-SCCS
• Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?
• Nonaxiomatisability of equivalences over finite state processes
• On Meije and SCCS: Infinite sum operators vs. non-guarded definitions
• On notation for ordinal numbers
• On the consistency of Koomen's fair abstraction rule
• On the expressiveness of interaction
• Process Algebra
• Symbolic bisimulations
• Termination, deadlock, and divergence
• The Value-Passing Calculus
• The \(\lambda \)-calculus in the \(\pi \)-calculus
• The theory of algorithms
• Time bounded random access machines
• \(\lambda\)-definability and recursiveness

Cited in

(8)

• Theory of interaction
• scientific article; zbMATH DE number 7204939 (Why is no real title available?)
• scientific article; zbMATH DE number 3903969 (Why is no real title available?)
• A thesis for interaction
• Counting nondeterministic computations
• Non-deterministic data types: Models and implementations
• scientific article; zbMATH DE number 4024793 (Why is no real title available?)
• Extensional Petri net

This page was built for publication: Non-deterministic structures of computation

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