Subclasses of Petri nets - Zemris
Subclasses of Petri nets - Zemris
Subclasses of Petri nets - Zemris
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
EE249: Design <strong>of</strong> Embedded System (corrections)<br />
ASV/LL<br />
Reachability graph<br />
t2<br />
p1 t1 p2 p3<br />
t3<br />
100<br />
t1<br />
010<br />
• For bounded <strong>nets</strong> the Coverability Tree is called<br />
Reachability Tree since it contains all possible<br />
reachable markings<br />
67<br />
Reachability graph<br />
t2<br />
p1 t1 p2 p3<br />
t3<br />
100<br />
t1<br />
010<br />
t3<br />
001<br />
• For bounded <strong>nets</strong> the Coverability Tree is called<br />
Reachability Tree since it contains all possible<br />
reachable markings<br />
68<br />
34
Change language