Abstract
The new class of Well Formed Coloured Nets (WN) is formally defined as an extension of Regular Nets (RN), together with an extended Symbolic Reachability Graph (SRG) construction algorithm. WNs allow the representation of any colour function in a structured form, so that they have the same modelling power as general coloured nets (CPN). In particular, with respect to RN, WNs allow the use of non-symmetric initial markings, of repeated occurrences of the same basic class in the Cartesian product defining the colours for transitions and places, and of the “constant” and “successor” functions as arc labels. The SRG allows colour symmetries to be exploited to reduce the space and time complexity of the analysis by reachability graph. The advantage of using WNs instead of unconstrained CPNs is that the detection of symmetries to construct the SRG is totally algorithmic, and requires no special heuristics.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
