DocumentCode
3322340
Title
A structural colour simplification in well-formed coloured nets
Author
Chiola, Giovanni ; Franceschinis, Giuliana
Author_Institution
Torino Univ., Italy
fYear
1991
fDate
2-5 Dec 1991
Firstpage
144
Lastpage
153
Abstract
Well-formed coloured Petri nets (WN) have been recently defined as a new formalism that allows the automatic identification of model symmetries by means of the construction of the symbolic reachability graph (SRG). The authors define a sufficient structural condition for the simplification of the colour structure of the net that can exploit symmetries not detectable with the SRG. The simplified WNs may have reduced SRG and in any case are easier to analyze by means of the SRG technique
Keywords
Petri nets; data structures; graph colouring; Petri nets; automatic identification; model symmetries; structural colour simplification; sufficient structural condition; symbolic reachability graph; well-formed coloured nets; Color; Concurrent computing; Distributed algorithms; Performance analysis; Petri nets; Power system modeling; Protocols; Roentgenium; State-space methods; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Petri Nets and Performance Models, 1991. PNPM91., Proceedings of the Fourth International Workshop on
Conference_Location
Melbourne, Vic.
Print_ISBN
0-8186-2285-7
Type
conf
DOI
10.1109/PNPM.1991.238773
Filename
238773
Link To Document