DocumentCode :
1184626
Title :
Additional methods for reduction and expansion of marked graphs
Author :
Johnsonbaugh, Richard ; Murata, Tadao
Volume :
28
Issue :
10
fYear :
1981
fDate :
10/1/1981 12:00:00 AM
Firstpage :
1009
Lastpage :
1014
Abstract :
This paper is concerned with transformations of marked graphs which preserve liveness and safeness. Three such transformations were previously given by Murata and Koh. We shall give three additional transformations each of which permits reductions and expansions not obtainable using other known transformations. In addition, we shall show how these transformations can be used in expanding and simplifying marked graphs taking into account the number of reachability classes and resource requirements.
Keywords :
Graph theory; Circuits and systems; Concurrent computing; Distortion measurement; Employee welfare; FETs; Frequency modulation; Harmonic distortion; Iterative algorithms; Linearity; Petri nets;
fLanguage :
English
Journal_Title :
Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-4094
Type :
jour
DOI :
10.1109/TCS.1981.1084918
Filename :
1084918
Link To Document :
بازگشت