Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata

Abstract

Abstract. The paper surveys some of the most recent approaches to verification of properties, expressible in some timed and untimed temporal logics (LTL, CTL, TCTL), for real-time systems represented by time Petri nets (TPN's) and timed automata (TA). Firstly, various structural translations from TPN's to TA are discussed. Secondly, model abstraction methods, based on state class approaches for TPN's, and on partition refinement for TA, are given. Next, SAT-based verification techniques, like bounded and unbounded model checking, are discussed. The main focus is on bounded model checking for TCTL and for reachability properties. The paper ends with a comparison of experimental results for several time Petri nets, obtained using the above solutions, i.e., either model abstractions for TPN's, or a translation of a net to a timed automaton and then verification methods for TA. The experiments have been performed using some available tools for TA and TPN's.

A Forward On-The-Fly Approach in Controller Synthesis of Time Petri Nets

“…For best performances, the contraction should also be the smallest possible and computed with minor resources too (time and space). The preserved properties are usually verified using standard analysis techniques on the abstractions [16].…”

TCTL Model Checking of Time Petri Nets

“…Recently, Virbitskaite and Pokozy in [39] proposed a method to model-check TCTL properties on TPN. The method is based on the region graph and is similar to the one proposed by Alur and Dill [1] extended by Yovine and Tripakis [38], and Penczeck [35] for TA. The TCTL formula is translated into a CTL formula and then model-checked using classical CTL algorithms on a modified TA.…”

Model Checking of Time Petri Nets

“…Properties of timed systems are usually specified using temporal logics (Penczek & Polrola, 2004). We consider here CTL* (computation tree logic star) and a subclass of TCTL (timed computation tree logic).…”

“…Formula φ 1 ⇝ Ir φ 2 is a shorthand for TCTL formula ∀G(φ 1 ⇒∀F Ir φ 2 ) which expresses a bounded response property. Several efficient model checking techniques were developed in the literature for LTL, CTL, CTL*, MITL and TCTL, using timed Büchi automata, fix point techniques, or hesitant alternating automata (Penczek & Polrola, 2004); (Tripakis et al, 2005); (Tripakis et al, 2001); (Visser & Barringer, 2000). To apply these techniques to time Petri nets, we must construct a finite abstraction for its generally infinite state space which preserves properties of interest.…”