Non-deterministic structures of computation

DOI10.1017/S0960129514000012zbMath1361.68083OpenAlexW2005689570MaRDI QIDQ5740658

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

Related Items (5)

Theory of interaction ⋮ Extensional Petri net ⋮ Unnamed Item ⋮ Counting nondeterministic computations ⋮ A thesis for interaction

Cites Work

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

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