For the most recent entries see the Petri Nets Newsletter.

On the Acceleration of Timing Verification Method Based on Time Petri Nets.

Yoneda, T.; Kondo, Y.; Tohma, Y.

In: Transactions of the Institute of Electronics, Information and Communication Engineers D-I, Vol. J74D-I, No. 3, pages 212-223. March 1991. In Japanese.

Abstract: Berthomieu (1983) proposed a verification method based on Time Petri Nets to prove correctness of timing properties for hard real-time systems. However, verifications sometimes take a long time to complete with this method. The authors first show that the verification problem is reducible to the single-place zero-reachability problem of Time Petri Nets by adding some places and transitions to the original nets. They present an analysis procedure to solve the single-place zero-reachability problem without producing all states of the given Time Petri Nets. Further, the performance of the method is compared with that of Berthomieu's method.

Keywords: acceleration (of) timing verification (based on) time nets; real-time system; verification problem reduction (to) single-place zero-reachability problem; performance evaluation.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography