| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 422124 | Electronic Notes in Theoretical Computer Science | 2009 | 11 Pages |
Abstract
We consider here time Petri nets and the covering steps graph technique proposed by Vernadat et al. for untimed Petri nets. In this technique, some transitions are put together to be fired in a single transition step. This paper investigates how this technique can be extended to be applied to time Petri nets.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
