Authors: Serkan Yorulmaz, Murvet Kirci
Addresses: Electronics and Communication Engineering Department, Istanbul Technical University, 34469 Maslak, Sarıyer, Istanbul, Turkey. ' Electronics and Communication Engineering Department, Istanbul Technical University, 34469 Maslak, Sarıyer, Istanbul, Turkey
Abstract: In this work, the analysis of behavioural and structural features of automated systems has been investigated by using coloured Petri Nets (CPNs). CPN is one of the best modelling methods of the automated system. Many features of Petri Nets can be searched by reachability tree and invariants. They also show the features of CPN. Reachability tree shows the markings which can be reached by the net. With P invariants we can determine the correctness of the net. In this work, an algorithm to calculate reachability tree of automated systems is developed. P invariants of CPN is analysed and Martinez-Silva algorithm is applied to CPNs. Time performances of these methods are also determined.
Keywords: coloured Petri Nets; CPNs; automated systems; reachability tree; p-invariants; modelling.
International Journal of Reasoning-based Intelligent Systems, 2010 Vol.2 No.3/4, pp.208 - 216
Published online: 12 Nov 2010 *Full-text access for editors Access for subscribers Purchase this article Comment on this article