Affiliation:
1. Department of Electrical Engineering, The Johns Hopkins University, Baltimore, Maryland
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]).
Publisher
Association for Computing Machinery (ACM)
Reference5 articles.
1. Third Generation Computer Systems
2. A comparison of two synchronizing concepts
3. S.S. Patil Coordination of Asynchronous Events Project MAC TR-72 June 1970. S.S. Patil Coordination of Asynchronous Events Project MAC TR-72 June 1970.
4. S.S. Patil Limitations and Capabilities of Dijkstra's Semaphore Primitives for Coordination among Processes Project MAC Memo 57 February 1971. S.S. Patil Limitations and Capabilities of Dijkstra's Semaphore Primitives for Coordination among Processes Project MAC Memo 57 February 1971.
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Modeling Classical Problems with Colored Petri Nets;Asset Analytics;2023
2. References;Embedded Software Development;2015-12-17
3. Benchmarking GPenSIM;Lecture Notes in Electrical Engineering;2014-11-08
4. Petri Nets with Localities and Testing;Applications and Theory of Petri Nets;2010
5. Phase Semantics and Petri Net Interpretation for Resource-Sensitive Strong Negation;Journal of Logic, Language and Information;2006-10-17