Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Limitations of Dijkstra's Semaphore Primitives and Petri nets

Limitations of Dijkstra's Semaphore Primitives and Petri nets 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). http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGOPS Operating Systems Review Association for Computing Machinery

Limitations of Dijkstra's Semaphore Primitives and Petri nets

ACM SIGOPS Operating Systems Review , Volume 7 (4) – Oct 1, 1973

Loading next page...
 
/lp/association-for-computing-machinery/limitations-of-dijkstra-s-semaphore-primitives-and-petri-nets-deuaReNMUM

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1973 by ACM Inc.
ISSN
0163-5980
DOI
10.1145/957195.808062
Publisher site
See Article on Publisher Site

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).

Journal

ACM SIGOPS Operating Systems ReviewAssociation for Computing Machinery

Published: Oct 1, 1973

There are no references for this article.