Bibliographic Details
| Title: |
Computing on semaphores of Dijkstra with place-transition nets. |
| Authors: |
Zaitsev, D. A.1 (AUTHOR) daze@acm.org |
| Source: |
International Journal of Parallel, Emergent & Distributed Systems. May2026, Vol. 41 Issue 3, p291-320. 30p. |
| Subjects: |
Petri nets, Asynchronous circuits, Recursion theory, Computer multitasking |
| Abstract: |
We consider the System V operation over a set of Dijkstra semaphores as a formal system and prove its Turing completeness. In this way, we define place-transition nets with a novel, stepless semantics, which implement transition firing rules similar to those of Petri and Salwicki. Each transition represents a thread, repeating an operation over a set of semaphores, which specify transition's incident arcs. To represent an efficient Sleptsov-Salwicki firing rule, a generalized operation over a set of semaphores is introduced. This opens prospects for fast asynchronous hardware and software implementations for the corresponding graphical language of concurrent programming. [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Parallel, Emergent & Distributed Systems is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
