Nonexpressibility of fairness and signaling

DOI10.1016/0022-0000(93)90034-TzbMath0801.68112OpenAlexW4213135660MaRDI QIDQ1309386

Prakash Panangaden, Vasant Shanbhogue, David Allen McAllester

Publication date: 20 December 1993

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(93)90034-t

zbMATH Keywords

fairnessexpressive powerprocess equivalencedata flow networks

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)

The expressive power of indeterminate dataflow primitives

Cites Work

• Proof rules and transformations dealing with fairness
• Theory of traces
• Concurrent transition systems
• A continuous semantics for unbounded nondeterminism
• The expressive power of indeterminate dataflow primitives
• LCF considered as a programming language
• A fully abstract trace model for dataflow and asynchronous networks
• A proof of the Kahn principle for input/output automata
• Countable nondeterminism and random assignment
• Semaphore primitives and starvation-free mutual exclusion
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nonexpressibility of fairness and signaling