REPRESENTATION OF NONSTRUCTURED CONCURRENCY BY PETRI-NET LANGUAGES
The concurrency is classified into two types: structured concurrency and nonstructured concurrency. After showing that the nonstructured concurrency cannot be represented by the conventional notations in the Petri net language, a method to represent such concurrency by the language is proposed. The proposed method allows us to utilize the existing approaches for analyzing properties of a nonstructured concurrency by the Petri net languages.
- Issue Date
- 1993
- Language
- English
- Article Type
- Letter
- Citation
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, v.23, no.3, pp.872 - 875
- ISSN
- 0018-9472
- Appears in Collection
- BiS-Journal Papers(저널논문)
- Files in This Item
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 2 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.