Name
Abstract | ||
|---|---|---|
Timed Petri net is an effective tool to evaluate discrete event systems. This paper treats the reachability problem of timed Petri nets. The problem aims to find the firing sequence which drives the initial marking M0 to the target marking Mf in minimal execution time. First, we consider the subclass in which non-delayed sequence gives the optimal solution. Then, an algorithm is proposed to solve the minimal time reachability problem of timed state machines. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ISCAS.2005.1464699 | ISCAS (1) |
Keywords | Field | DocType |
Petri nets,discrete event simulation,discrete event systems,reachability analysis,discrete event systems,firing sequence,initial marking,minimal execution time,minimal time reachability problem,nondelayed sequence,target marking,timed Petri net subclasses,timed state machines | Discrete mathematics,Petri net,Control theory,Computer science,Finite-state machine,Theoretical computer science,Stochastic Petri net,Execution time,Reachability problem,Processor scheduling,Computational complexity theory,Discrete event simulation | Conference |
ISSN | ISBN | Citations |
0271-4302 | 0-7803-8834-8 | 0 |
PageRank | References | Authors |
0.34 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| atsushi ohta | 1 | 66 | 15.31 |
| Kohkichi Tsuji | 2 | 3 | 2.44 |
| Tomiji Hisamura | 3 | 0 | 0.34 |