Analysis of automated systems by using coloured Petri Nets
by Serkan Yorulmaz, Murvet Kirci
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 2, No. 3/4, 2010

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.

Online publication date: Fri, 12-Nov-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Reasoning-based Intelligent Systems (IJRIS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com