Using Integer Time Steps for Checking Branching Time Properties of Time Petri Nets

Abstract

Abstract. Verification of timed systems is an important subject of research, and one of its crucial aspects is the efficiency of the methods developed. Extending the result of Popova which states that integer time steps are sufficient to test reachability properties of time Petri nets [5,8], in our work we prove that the discrete-time semantics is also sufficient to verify ECTL * and ACTL * properties of TPNs with the dense semantics. To show that considering this semantics instead of the dense one is profitable, we compare the results for SAT-based bounded model checking of ACTL−X properties and the class of distributed time Petri nets.

SMT-Based Reachability Checking for Bounded Time Petri Nets

“…It has been shown that such a model is simulation equivalent to the dense one [8], and therefore preserves a subclass of branching-time properties [7] and, in particular, reachability [16]. A definition of the simulation equivalence can be found in the appendix.…”

“…Based on the above lemma and on the fact that M (N ) and M d (N ) are simulation equivalent [8], we can formulate the following corollary: Copyright of Fundamenta Informaticae is the property of IOS Press and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use.…”