Arbiters: An exercise in specifying and decomposing asynchronously communicating components

DOI10.1016/0167-6423(92)90017-6MaRDI QIDQ1193741zbMATH OpenOpenAlexFDO

Authors Jo C. Ebergen

Publication date 27 September 1992

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(92)90017-6

zbMATH Keywords

arbitersasynchronously communicating componentsdecompositionderivationspecificationsyntaxverification

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Specification and design of shared resource arbitration
• Ideal Arbiters: Analysis and Design
• scientific article; zbMATH DE number 3999273
• Asynchronous system synthesis
• scientific article; zbMATH DE number 3997155

Cited in

(5)

• Specification and design of shared resource arbitration
• Newtonian arbiters cannot be proven correct
• A linear-time branching-time perspective on interface automata
• Component refinement and CSC-solving for STG decomposition
• Ideal Arbiters: Analysis and Design

This page was built for publication: Arbiters: An exercise in specifying and decomposing asynchronously communicating components

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