Commutation properties and generating sets characterize slices of various synchronization primitives

Danny Dolev

doi:10.1016/0304-3975(79)90018-5

Commutation properties and generating sets characterize slices of various synchronization primitives

Danny Dolev^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

Various synchronization primitives are described by adding and testing integer vectors, or by using "Petri Nets". A slice represents a local behavior, described by permissible sequences of distinct actions of the system. We present a double characterization of slices defined by various synchronization primitives: In terms of generating sets and dually in terms of commutation properties. A typical form of a commutation property is: The set of sequences of past actions which disallow a certain coming action is closed under certain permutations. The synchronization primitives treated here include various systems which lie between PV and Vector Replacement Systems or Petri Nets.

Original language	English
Pages (from-to)	379-391
Number of pages	13
Journal	Theoretical Computer Science
Volume	8
Issue number	3
DOIs	https://doi.org/10.1016/0304-3975(79)90018-5
State	Published - Jun 1979
Externally published	Yes

Access to Document

10.1016/0304-3975(79)90018-5

Cite this

@article{26a369488e3645be8d2cf28bbc94ef61,

title = "Commutation properties and generating sets characterize slices of various synchronization primitives",

abstract = "Various synchronization primitives are described by adding and testing integer vectors, or by using {"}Petri Nets{"}. A slice represents a local behavior, described by permissible sequences of distinct actions of the system. We present a double characterization of slices defined by various synchronization primitives: In terms of generating sets and dually in terms of commutation properties. A typical form of a commutation property is: The set of sequences of past actions which disallow a certain coming action is closed under certain permutations. The synchronization primitives treated here include various systems which lie between PV and Vector Replacement Systems or Petri Nets.",

author = "Danny Dolev",

year = "1979",

month = jun,

doi = "10.1016/0304-3975(79)90018-5",

language = "אנגלית",

volume = "8",

pages = "379--391",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - Commutation properties and generating sets characterize slices of various synchronization primitives

AU - Dolev, Danny

PY - 1979/6

Y1 - 1979/6

N2 - Various synchronization primitives are described by adding and testing integer vectors, or by using "Petri Nets". A slice represents a local behavior, described by permissible sequences of distinct actions of the system. We present a double characterization of slices defined by various synchronization primitives: In terms of generating sets and dually in terms of commutation properties. A typical form of a commutation property is: The set of sequences of past actions which disallow a certain coming action is closed under certain permutations. The synchronization primitives treated here include various systems which lie between PV and Vector Replacement Systems or Petri Nets.

AB - Various synchronization primitives are described by adding and testing integer vectors, or by using "Petri Nets". A slice represents a local behavior, described by permissible sequences of distinct actions of the system. We present a double characterization of slices defined by various synchronization primitives: In terms of generating sets and dually in terms of commutation properties. A typical form of a commutation property is: The set of sequences of past actions which disallow a certain coming action is closed under certain permutations. The synchronization primitives treated here include various systems which lie between PV and Vector Replacement Systems or Petri Nets.

UR - https://www.scopus.com/pages/publications/49249146164

U2 - 10.1016/0304-3975(79)90018-5

DO - 10.1016/0304-3975(79)90018-5

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:49249146164

SN - 0304-3975

VL - 8

SP - 379

EP - 391

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 3

ER -

Commutation properties and generating sets characterize slices of various synchronization primitives

Abstract

Access to Document

Other files and links

Fingerprint

Cite this