scientific article; zbMATH DE number 4092750

zbMATH Open0667.68035MaRDI QIDQ3819986FDOQ3819986

Authors Prakash Panangaden, Vasant Shanbhogue

Publication date 1988

zbMATH Keywords

dataflow networksambangelic mergecountable non-determinacyfar merge

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Recommendations

• The merger-paradox: a tournament-based solution
• scientific article; zbMATH DE number 3890714
• On the inefficiency of merger control
• scientific article; zbMATH DE number 4001497
• An impossibility theorem for allocation aggregation
• Strategy-proof and fair assignment is wasteful
• Weak and strong fairness in CCS
• scientific article; zbMATH DE number 3878339
• Impossibility of stable and nonbossy matching mechanisms

Cited in

(5)

• On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus
• Nonexpressibility of fairness and signaling
• Fair, biased, and self-balancing merge operators: Their specification and implementation in Concurrent Prolog
• scientific article; zbMATH DE number 3902001 (Why is no real title available?)
• The expressive power of indeterminate primitives in asynchronous computation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3819986)