Acceleration of timing verification method based on time petri nets

Abstract

AbstractA verification method based on time Petri nets automatically proves the correctness of quantitative timing properties for hard real‐time systems. However, the previously proposed method sometimes takes a very long time or requires considerable memory space to complete verifications. This is because the method generates the whole state space of time Petri nets.This paper proposes an efficient verification method based on the single‐place zero‐reachability problem of time Petri nets, but it may be restricted by given time Petri nets. The single‐place zero‐reachability problem can be solved only by checking whether or not some prescribed transitions can finally fire. This does not require extracting the whole state space of time Petri nets.The method proposed herein: (1) reduces the verification problem to the single‐place zero‐reachability problem of time Petri nets; and (2) generates reduced state space sufficient to check the possibility of the firings of all enabled transitions. This paper also contains an example of verifying a simple LAN protocol and compares the performance of both the proposed method and the previous method.