Analysis of automated systems by using coloured Petri Nets

Serkan Yorulmaz, M. ürvet Kirci*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)208-216
Number of pages9
JournalInternational Journal of Reasoning-based Intelligent Systems
Issue number3-4
Publication statusPublished - 2010


  • automated system
  • coloured Petri Nets
  • CPNs
  • p-invariants
  • reachability tree


Dive into the research topics of 'Analysis of automated systems by using coloured Petri Nets'. Together they form a unique fingerprint.

Cite this