Commutation properties and generating sets characterize slices of various synchronization primitives

DOI10.1016/0304-3975(79)90018-5zbMath0403.68053OpenAlexW2165060910MaRDI QIDQ1256315

Danny Dolev

Publication date: 1979

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(79)90018-5

zbMATH Keywords

SlicesCommutation PropertiesGenerating SetsPetri NetzPrefix Closed Subsets of WordsSynchronization PrimitivesVector Replacement Systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Artificial intelligence (68T99) Theory of computing (68Q99)

Cites Work

• Commutation relations of slices characterize some synchronization primitives
• On an extension of Dijkstra's semaphore primitives
• Synchronization Problems Solvable by Generalized PV Systems
• Reduction
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Commutation properties and generating sets characterize slices of various synchronization primitives