The expressive power of indeterminate dataflow primitives

DOI10.1016/0890-5401(92)90043-FzbMath0754.68082OpenAlexW1973795188MaRDI QIDQ1201292

Vasant Shanbhogue, Prakash Panangaden

Publication date: 17 January 1993

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(92)90043-f

zbMATH Keywords

distributed systemstrace semanticsindeterminate computing systems

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Fairness, Resources, and Separation ⋮ Towards a complete hierarchy of compositional dataflow models ⋮ Confluence in concurrent constraint programming ⋮ Equational reasoning about nondeterministic processes ⋮ The expressive power of indeterminate dataflow primitives ⋮ Confluence in concurrent constraint programming ⋮ Interaction Nets with McCarthy's amb ⋮ Refinement of time ⋮ A timed concurrent constraint language. ⋮ Nonexpressibility of fairness and signaling

Cites Work

• Proof rules and transformations dealing with fairness
• Theory of traces
• Concurrent transition systems
• The expressive power of indeterminate dataflow primitives
• Nonexpressibility of fairness and signaling
• A fully abstract trace model for dataflow and asynchronous networks
• Linear time and branching time semantics for recursion with merge
• A proof of the Kahn principle for input/output automata
• Countable nondeterminism and random assignment
• A Powerdomain Construction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item