Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Asynchronous Links in the PBC and M-Nets
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Performance Evaluation of Systems Using Nets
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Compositional High Level Petri Nets with Timing Constraints — A Comparison
ACSD '03 Proceedings of the Third International Conference on Application of Concurrency to System Design
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
Hierarchical timed high level nets and their branching processes
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Time and Petri Nets
| Hi-index | 0.00 |
In this paper we consider Interval-Timed Petri nets ITPN which are an extension of Timed Petri nets. They are considered to behave with discrete delays. The class of ITPNs is Turing complete and therefore the reachability of an arbitrary marking in such a net is not decidable. We introduce a time dependent state equation for a firing sequence of ITPNs, which is analogous to the state equation for a firing sequence in standard Petri nets and we prove its correctness using linear algebra. Our result is original and delivers both a necessary condition for reachability and a sufficient condition for non-reachability of an arbitrary marking in an ITPN.