Bounded model checking of Time Petri Nets using SAT solver
نویسندگان
چکیده
منابع مشابه
Bounded model checking of Time Petri Nets using SAT solver
To carry out performance evaluation of an asynchronous system, the system is modeled as Time Petri Net (TPN) and an iteration of Petri net simulations produces its performance index. The TPN model needs to satisfy required properties such as deadlock freeness. We proposed a symbolic representation of TPN for SAT-based bounded model checking. In the proposed encoding scheme, firing of transition...
متن کاملModel Checking Bounded Prioritized Time Petri Nets
In a companion paper [BPV06], we investigated the expressiveness of Time Petri Nets extended with Priorities and showed that it is very close to that Timed Automata, in terms of weak timed bisimilarity. As a continuation of this work we investigate here the applicability of the available state space abstractions for Bounded Time Petri Nets to Bounded Prioritized Time Petri Nets. We show in part...
متن کاملModel Checking Time Petri Nets using NuSMV
Time Petri Nets (TPN) are Petri Net based models augmented with timing information by associating an interval to each transition. The ring time of a transition is chosen non-deterministically (but not in a stochastic manner) from its associated interval. This paper presents a technique to check if a TPN satis es temporal properties expressed in real-time Computational Tree Logic (RTCTL). The tr...
متن کاملModel Checking of Time Petri Nets
This paper considers time Petri nets (TPN model) for model checking. The main challenge in model checking techniques is to construct, with lesser resources (time and space), a much coarser abstraction preserving properties of interest. These properties can be verified using standard model checking techniques. In this paper, we review some techniques, proposed in the literature, to model check u...
متن کاملTCTL Model Checking of Time Petri Nets
We consider Time Petri Nets (TPN) for which a firing time interval is associated with each transition. State space abstractions for TPN preserving various classes of properties (LTL, CTL, CTL) can be computed, in terms of so called state classes. Some methods were proposed to check quantitative timed properties but are not suitable for effective verification of properties of real-life systems. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Electronics Express
سال: 2015
ISSN: 1349-2543
DOI: 10.1587/elex.11.20141112