The geometry of semaphore programs

DOI10.1145/9758.9759MaRDI QIDQ3763578zbMATH OpenOpenAlexFDO

Authors S. D. Carson, Paul Reynolds

Publication date 1987

Published in ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/toplas/1987-9/

zbMATH Keywords

concurrent processesconcurrent programsconcurrent semaphore programsDeadlockmutual exclusionstatic deadlock detectionSynchronization errors

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• CONCUR 2005 – Concurrency Theory
• A discrete geometric model of concurrent program execution
• scientific article; zbMATH DE number 4179372
• From geometric semantics to asynchronous computability
• Some geometric perspectives in concurrency theory
• Formal relationships between geometrical and classical models for concurrency
• scientific article; zbMATH DE number 1766941
• Geometric and combinatorial views on asynchronous computability
• Geometry and concurrency: a user's guide

Cited in

(11)

• From geometric semantics to asynchronous computability
• A ``geometric view of the dynamics of trajectories of computer programs
• Algebraic topology and concurrency
• The geometry of timed PV programs
• A discrete geometric model of concurrent program execution
• Unique decomposition of homogeneous languages and application to isothetic regions
• The geometry of conservative programs
• Streams, \(d\)-spaces and their fundamental categories
• Cut-off theorems for the \textit{PV}-model
• Non-Hausdorff parallelized manifolds over geometric models of conservative programs
• Deadlocks and dihomotopy in mutual exclusion models

This page was built for publication: The geometry of semaphore programs

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