Additional methods for reduction and expansion of marked graphs
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 tran...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on circuits and systems 1981-10, Vol.28 (10), p.1009-1014 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 0098-4094 1558-1276 |
DOI: | 10.1109/TCS.1981.1084918 |