View in EDS

Computing on semaphores of Dijkstra with place-transition nets.

Saved in:
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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 193388325
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Computing on semaphores of Dijkstra with place-transition nets.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Zaitsev%2C+D%2E+A%2E%22">Zaitsev, D. A.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> daze@acm.org</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Parallel%2C+Emergent+%26+Distributed+Systems%22">International Journal of Parallel, Emergent & Distributed Systems</searchLink>. May2026, Vol. 41 Issue 3, p291-320. 30p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Petri+nets%22">Petri nets</searchLink><br /><searchLink fieldCode="DE" term="%22Asynchronous+circuits%22">Asynchronous circuits</searchLink><br /><searchLink fieldCode="DE" term="%22Recursion+theory%22">Recursion theory</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+multitasking%22">Computer multitasking</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=193388325
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1080/17445760.2026.2615010
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 30
        StartPage: 291
    Subjects:
      – SubjectFull: Petri nets
        Type: general
      – SubjectFull: Asynchronous circuits
        Type: general
      – SubjectFull: Recursion theory
        Type: general
      – SubjectFull: Computer multitasking
        Type: general
    Titles:
      – TitleFull: Computing on semaphores of Dijkstra with place-transition nets.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Zaitsev, D. A.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 05
              Text: May2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 17445760
          Numbering:
            – Type: volume
              Value: 41
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: International Journal of Parallel, Emergent & Distributed Systems
              Type: main
ResultId 1