On relating concurrency and nondeterminism

DOI10.1007/3-540-55511-0_19zbMath1518.68226MaRDI QIDQ6116582

Luca Aceto

Publication date: 16 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

A general conservative extension theorem in process algebras with inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Observation equivalence as a testing equivalence
• Algebra of communicating processes with abstraction
• Modeling concurrency with partial orders
• Concurrency and atomicity
• A calculus of communicating systems
• Testing equivalences for processes
• A domain equation for bisimulation
• Distributed bisimulations
• A Theory of Communicating Sequential Processes
• Algebraic laws for nondeterminism and concurrency
• Axiomatising Finite Concurrent Processes

This page was built for publication: On relating concurrency and nondeterminism