Limitations of Dijkstra's Semaphore Primitives and Petri nets

Authors:
S. Rao Kosaraju
Affiliations:
Department of Electrical Engineering, The Johns Hopkins University, Baltimore, Maryland
Venue:
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
Year:
1973

Citing 2
Cited 5

Third Generation Computer Systems

ACM Computing Surveys (CSUR)
COORDINATION OF ASYNCHRONOUS EVENTS

COORDINATION OF ASYNCHRONOUS EVENTS

A proposal for certain process management and intercommunication primitives

ACM SIGOPS Operating Systems Review
A synthesis rule for concurrent systems

DAC '78 Proceedings of the 15th Design Automation Conference
An algebraic system for process structuring and interprocess communication

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Petri nets with localities and testing

PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
ON SYNCHRONIZATION LANGUAGES

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently various attempts have been made to study the limitations of Dijkstra's Semaphore Primitives for the synchronization problem of cooperating sequential processes [3,4,6,8]. Patil [8] proves that the semaphores with the P and V primitives are not sufficiently powerful. He suggests a generalization of the P primitive. We prove that certain synchronization problems cannot be realized with the above generalization and even with arrays of semaphores. We also show that even the general Petri nets will not be able to handle some synchronization problems, contradicting a conjecture of Patil (P.28 [7]).