Non-deterministic structures of computation
From MaRDI portal
Publication:5740658
DOI10.1017/S0960129514000012zbMATH Open1361.68083OpenAlexW2005689570MaRDI QIDQ5740658FDOQ5740658
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formal Reductions of the General Combinatorial Decision Problem
- Higher-level synchronising devices in Meije-SCCS
- Title not available (Why is that?)
- Functions as processes
- Bisimulation can't be traced
- Calculi for synchrony and asynchrony
- A calculus of mobile processes. I
- A calculus of mobile processes. II
- On notation for ordinal numbers
- Termination, deadlock, and divergence
- Bisimulation and divergence
- Process Algebra
- A complete inference system for a class of regular behaviours
- A complete axiomatisation for observational congruence of finite-state behaviours
- On the consistency of Koomen's fair abstraction rule
- On the expressiveness of interaction
- Time bounded random access machines
- Symbolic bisimulations
- A theory of communicating processes with value passing
- Nonaxiomatisability of equivalences over finite state processes
- An Unsolvable Problem of Elementary Number Theory
- The Value-Passing Calculus
- General recursive functions of natural numbers
- Computability and λ-definability
- On Meije and SCCS: Infinite sum operators vs. non-guarded definitions
- Axiomatising divergence
- The \(\lambda \)-calculus in the \(\pi \)-calculus
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?
- \(\lambda\)-definability and recursiveness
- The theory of algorithms
Cited In (8)
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)