Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)
- 2000.07b
- /
- Pages.641-644
- /
- 2000
On the Reachability Set of Petri Net under the Earliest Firing Rule
- Ohta, Atsushi (Aichi Prefectural University) ;
- Seto, Hiroaki (Yamaha Corp.) ;
- Tsuji, Kohkichi (Aichi Prefectural University)
- Published : 2000.07.01
Abstract
This paper studies coverability tree and reach-ability set of Petri net under the earliest filing rule. Conventional algorithm for coverability tree for ‘normal’ Petri net is not good for Petri net under the earliest firing rule. More over, it is shown that there exists no coverability graph for general class of earliest firing Petri net. Some subclasses are studied where coverability graph can be constructed.
Keywords