Logic

Download Advances in Verification of Time Petri Nets and Timed by Doc.dr.hab. Wojciech Penczek, Dr. Agata Pólrola (auth.) PDF

By Doc.dr.hab. Wojciech Penczek, Dr. Agata Pólrola (auth.)

This monograph provides a complete creation to timed automata (TA) and
time Petri nets (TPNs) which belong to the main regular versions of real-time
systems. the various current equipment of translating time Petri nets to timed
automata are provided, with a spotlight at the translations that correspond to the
semantics of time Petri nets, associating clocks with numerous elements of the
nets. "Advances in Verification of Time Petri Nets and Timed Automata – A Temporal
Logic procedure" introduces timed and untimed temporal specification languages
and supplies version abstraction tools according to kingdom type ways for TPNs
and on partition refinement for TA. in addition, the monograph provides a up to date growth
in the improvement of 2 version checking tools, in line with both exploiting
abstract nation areas or on software of SAT-based symbolic ideas.

The publication addresses examine scientists in addition to graduate and PhD scholars
in desktop technological know-how, logics, and engineering of genuine time systems.

Show description

Read or Download Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach PDF

Best logic books

Introduction to Mathematical Logic

This confirmed common covers the elemental issues for a primary direction in mathematical common sense. during this version, the writer has further an intensive appendix on second-order good judgment, a piece on set idea with urelements, and a bit at the good judgment that effects after we permit versions with empty domain names.

Mathematical Logic and Model Theory: A Brief Introduction

Mathematical common sense and version thought: a short creation bargains a streamlined but easy-to-read advent to mathematical good judgment and easy version thought. It provides, in a self-contained demeanour, the basic features of version conception had to comprehend version theoretic algebra. As a profound software of version conception in algebra, the final a part of this ebook develops a whole evidence of Ax and Kochen's paintings on Artin's conjecture approximately Diophantine homes of p-adic quantity fields.

Additional resources for Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach

Example text

4 Progressiveness in Time Petri Nets As it has been already stated (see p. 20), we consider only nets whose all the runs starting at the initial state are progressive. However, for a given N one cannot say without any prior analysis whether or not N does satisfy this condition. Below, we discuss this problem more thoroughly. The first case in which runs of a net are non-progressive can occur if the net contains no loop, and therefore is of finite runs only (consider, for instance, the net like in Fig.

15. Consider the time Petri net N shown in Fig. 8. The net contains a structural deadlock (if the transition t2 is fired, no further firings are possible). However, when p3 becomes marked, the timing intervals of the transitions t2 and t3 force t3 to be fired before t2 , which prevents firing of t2 and deadlocks. t3 [0,1] p1 t1 p3 [1,2] p2 t2 [3,4] Fig. 8. A deadlock-free time Petri net with a structural deadlock The structural analysis of the untimed net can therefore exclude a deadlock for the weakly monotonic semantics, but to check whether it occurs, or to deal with the strongly monotonic case, another method needs to be applied.

W. Penczek and A. com 4 1 Petri Nets with Time p1 2 t1 1 p3 1 p5 1 t4 1 p7 3 t3 1 p2 t2 2 1 1 1 1 1 p4 t5 t6 1 p6 1 p8 Fig. 1. 2. An example of a Petri net is shown in Fig. 1. The set of places of this net is given by P = {p1 , . . , p8 }, the set of transitions by T = {t1 , . . , t5 }, and the initial marking is m0 (p1 ) = 3, m0 (p2 ) = 1, and m0 (pi ) = 0 for i = 3, . . , 8. The flow function is defined1 by ⎧ 3 ⎪ ⎪ ⎪ ⎨2 F (z) = 1 ⎪ ⎪ ⎪ ⎩ 0 for z = (t3 , p5 ) for z ∈ {(p1 , t1 ), (t2 , p2 )} for z ∈ {(t1 , p3 ), (p2 , t2 ), (t2 , p4 ), (p3 , t3 ), (p4 , t3 ), (t3 , p6 ), (p5 , t4 ), (t4 , p7 ), (p6 , t5 ), (t5 , p8 ), (p8 , t6 ), (t6 , p8 )} otherwise.

Download PDF sample

Rated 4.27 of 5 – based on 47 votes