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.
| Original language | English |
|---|---|
| Pages (from-to) | 208-216 |
| Number of pages | 9 |
| Journal | International Journal of Reasoning-based Intelligent Systems |
| Volume | 2 |
| Issue number | 3-4 |
| DOIs | |
| Publication status | Published - 2010 |
Keywords
- automated system
- coloured Petri Nets
- CPNs
- p-invariants
- reachability tree