Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
نویسندگان
چکیده
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time how to apply BMC to parametric verification of time Petri nets with discrete-time semantics. The properties are expressed by formulas of the logic PRTECTL a parametric extension of the existential fragment of Computation Tree Logic (CTL).
منابع مشابه
Using Integer Time Steps for Checking Branching Time Properties of Time Petri Nets
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 ...
متن کاملSAT-Based (Parametric) Reachability for a Class of Distributed Time Petri Nets
Formal methods among them the model checking techniques play an important role in the design and production of both systems and software. In this paper we deal with an adaptation of the bounded model checking methods for timed systems, developed for timed automata, to the case of time Petri nets. We consider distributed time Petri nets and parametric reachability checking, but the approach can ...
متن کاملBounded Parametric Model Checking for Elementary Net Systems
Bounded Model Checking (BMC) is an efficient verification method for reactive systems. BMC has been applied so far to verification of properties expressed in (timed) modal logics, but never to their parametric extensions. In this talk we show, for the first time, that BMC can be extended to PRTECTL – the parametric extension of the existential version of CTL. To this aim we define a bounded sem...
متن کاملSoundness of Timed-Arc Workflow Nets in Discrete and Continuous-Time Semantics
Analysis of workflow processes with quantitative aspects like timing is of interest in numerous time-critical applications. We suggest a workflow model based on timed-arc Petri nets and study the foundational problems of soundness and strong (time-bounded) soundness. We first consider the discrete-time semantics (integer delays) and explore the decidability of the soundness problems and show, a...
متن کاملHybrid Time Delay Petri Nets as a Mathematical Novel Tool to Model Dynamic System with Current Sample Time
The existing modeling methods using Petri Nets, have been successfully applied to model and analyze dynamic systems. However, these methods are not capable of modeling all dynamic systems such as systems with the current sample time signals, systems including various subsystems and multi-mode systems. This paper proposes Hybrid Time Delay Petri Nets (HTDPN) to solve the problem. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 101 شماره
صفحات -
تاریخ انتشار 2010