REPRESENTATION OF NONSTRUCTURED CONCURRENCY BY PETRI-NET LANGUAGES

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 148
  • Download : 471
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.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
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
URI
http://hdl.handle.net/10203/18481
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 webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0