Action systems, unbounded nondeterminism, and infinite traces

DOI10.1007/BF01214622zbMath0939.68635OpenAlexW1995450284WikidataQ59626085 ScholiaQ59626085MaRDI QIDQ1805399

Yanyan Li

Publication date: 4 July 2000

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01214622

Mathematics Subject Classification ID

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

Related Items (1)

An Algebraic Approach to Refinement with Fair Choice

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theoretical basis for stepwise refinement and the programming calculus
• Stepwise refinement of parallel algorithms
• A state-based approach to communicating processes
• A lattice-theoretical fixpoint theorem and its applications
• Unbounded Non-determinism in CSP
• The specification statement
• Communicating Sequential Processes. The First 25 Years

This page was built for publication: Action systems, unbounded nondeterminism, and infinite traces