An axiomatic definition of synchronization primitives

DOI10.1007/BF00261260MaRDI QIDQ1157157zbMATH OpenFDO

Authors Alain J. Martin

Publication date 1981

Published in Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

fairnessprogressboundednessdeadlockunbuffered communication primitives

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Cited in

(4)

• Synchronous, asynchronous, and causally ordered communication
• The probe: An addition to communication primitives
• The sliding-window protocol revisited
• Fair mutual exclusion with unfair P and V operations

This page was built for publication: An axiomatic definition of synchronization primitives

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