TCTL Model Checking of Time Petri Nets
نویسندگان
چکیده
منابع مشابه
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. ...
متن کاملImproved Region-Based TCTL Model Checking of Time Petri Nets
The most important challenge in the region-based abstraction method as an approach to compute the state space of time Petri Nets (TPNs) for model checking is that the method results in a huge number of regions, causing a state explosion problem. Thus, region-based abstraction methods are not appropriate for use in developing practical tools. To address this limitation, this paper applies a modi...
متن کامل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...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2009
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/exp036