Transition-Systems, Event Structures, and Unfoldings

Mogens Nielsen; Grzegorz Rozenberg; P.S. Thiagarajan

doi:10.1006/inco.1995.1062

Transition-Systems, Event Structures, and Unfoldings

Mogens Nielsen, Grzegorz Rozenberg, P.S. Thiagarajan

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review

Abstract

A subclass of transition systems called elementary transition systems can be identified with the help of axioms based on a structural notion called regions. Elementary transition systems have been shown to be the transition system model of a basic system model of net theory called elementary net systems. Here we show that by smoothly strengthening the regional axioms for elementary transition systems, one obtains a subclass called occurrence transition system. We then prove that occurrence transition systems are the transition system model of yet another basic model of concurrency, namely, prime event structures. We then propose an operation of unfolding elementary transition systems into occurrence transition systems, We prove that it is "correct" in a strong categorical sense.

Original language	English
Journal	Information and Computation
Volume	118
Issue	2
Pages (from-to)	191-207
ISSN	0890-5401
DOIs	https://doi.org/10.1006/inco.1995.1062
Publication status	Published - 1995

Access to Document

10.1006/inco.1995.1062

Cite this

@article{2bcca1f0f16b11dfa891000ea68e967b,

title = "Transition-Systems, Event Structures, and Unfoldings",

abstract = "A subclass of transition systems called elementary transition systems can be identified with the help of axioms based on a structural notion called regions. Elementary transition systems have been shown to be the transition system model of a basic system model of net theory called elementary net systems. Here we show that by smoothly strengthening the regional axioms for elementary transition systems, one obtains a subclass called occurrence transition system. We then prove that occurrence transition systems are the transition system model of yet another basic model of concurrency, namely, prime event structures. We then propose an operation of unfolding elementary transition systems into occurrence transition systems, We prove that it is {"}correct{"} in a strong categorical sense.",

author = "Mogens Nielsen and Grzegorz Rozenberg and P.S. Thiagarajan",

year = "1995",

doi = "10.1006/inco.1995.1062",

language = "English",

volume = "118",

pages = "191--207",

journal = "Information and Computation",

issn = "0890-5401",

publisher = "Academic Press",

number = "2",

}

TY - JOUR

T1 - Transition-Systems, Event Structures, and Unfoldings

AU - Nielsen, Mogens

AU - Rozenberg, Grzegorz

AU - Thiagarajan, P.S.

PY - 1995

Y1 - 1995

N2 - A subclass of transition systems called elementary transition systems can be identified with the help of axioms based on a structural notion called regions. Elementary transition systems have been shown to be the transition system model of a basic system model of net theory called elementary net systems. Here we show that by smoothly strengthening the regional axioms for elementary transition systems, one obtains a subclass called occurrence transition system. We then prove that occurrence transition systems are the transition system model of yet another basic model of concurrency, namely, prime event structures. We then propose an operation of unfolding elementary transition systems into occurrence transition systems, We prove that it is "correct" in a strong categorical sense.

AB - A subclass of transition systems called elementary transition systems can be identified with the help of axioms based on a structural notion called regions. Elementary transition systems have been shown to be the transition system model of a basic system model of net theory called elementary net systems. Here we show that by smoothly strengthening the regional axioms for elementary transition systems, one obtains a subclass called occurrence transition system. We then prove that occurrence transition systems are the transition system model of yet another basic model of concurrency, namely, prime event structures. We then propose an operation of unfolding elementary transition systems into occurrence transition systems, We prove that it is "correct" in a strong categorical sense.

U2 - 10.1006/inco.1995.1062

DO - 10.1006/inco.1995.1062

M3 - Journal article

SN - 0890-5401

VL - 118

SP - 191

EP - 207

JO - Information and Computation

JF - Information and Computation

IS - 2

ER -

Transition-Systems, Event Structures, and Unfoldings

Abstract

Access to Document

Fingerprint

Cite this