Computation Tree Logic (CTL)
|
|
- Anthony Curtis Wright
- 6 years ago
- Views:
Transcription
1 Computation Tree Logic (CTL) 1
2 CTL Syntax P - a set of atomic propositions, every p P is a CTL formula. f, g, CTL formulae, then so are f, f g, EXf, A[fUg], E[fUg] E, A path quantifiers, X, U, G, F temporal operators Interpreted over a tree of states: EXf - f holds in some immediate successor A[fUg] - every path has a prefix that satisfies [fug] 2
3 CTL Model (Kripke model) M = (S, s I, R, L) S is a finite set of states, s I S is the initial state R S S s.t. u S. v S. (u,v) R (total) L: S 2 AP Example: AP = {p,q,r} S1 {p} S0 {p,q} S2 {q} 3
4 Example: XR Control Program closed opened close!/go closing stop} {open!} {Tout,Tin} {close!,go} 4
5 Computation Tree The infinite computation tree spanned by a model M=(S,s I,R,L) root s 0 =s i s t is an arc in the tree iff (s,t) R. A path is: s 0,s 1,s 2, S s.t. i. (s i,s i+1 ) R S0 S0 S1 S1 S0 S2 S1 S2 S1 S2 S0 5
6 CTL Semantics w.r.t a given model (S,s I,R,L) and a state s S: s p iff p L(s) s f iff not s f s f g iff s f and s g s EXf iff s. (s,s ) R and s f s A[fUg] iff for every path (s 0, s 1, ) s.t s 0 =s, k 0. s k g i. 0 i k s i f s E[fUg] iff for some path (s 0, s 1, ) s.t s 0 =s, k 0. s k g i. 0 i k s i f f is satisfiable iff there exists a model (S,s I,R,L) such that s I f f is valid iff f is satisfiable by every model (S,s I,R,L) 6
7 Derived Operators AX(f) EX f AF(f) A[true U f] EF(f) E[true U f] AG(f) EF( f) EG(f) AF( f) f holds at all next states f holds in the future of every path f holds in the future of some path every state in every path satisfies f for some path every state satisfies f 7
8 8
9 A note on temporal wff Syntax: EXf, A[fUg], E[fUg] E, A path quantifiers X, U, G, F temporal operators Structure of a formula: (path)(temporal)[formula] E, A path quantifiers X, U, G, F temporal operators EF(Gu) is not a wff, only EF(EGu) or EF(AGu) A(fUg) cannot be derived from E(fUg) since E (fug) is not wff (since (fug) is not wff) 9
10 Properties Expressed in CTL Every req is followed by ack (not 1-1): AG(req AF ack) It is possible to get to a state where started holds but ready does not hold. EF(started ready) From any state it is possible to get to the restart state. AG EF restart Processes P,Q are not in their critical section simultaneously AG( (PC QC)) A process that asks to enter the critical section, eventually gets there AG(PE AF(PC)) Processes strictly alternate in access to the critical section AG(Pc A(PcU( Pc A( PcUQc)))) 10
11 Expressing Time in CTL Assertions: 50 seconds minimal delay between trains. AG(Tin AX Tin AXAX Tin AX..AX Tin ) It takes a train 6 seconds to arrive at the signal AG(Tin AX(AX(AX(AX(AX(AX(AtSignal))))))) however, we could write AG(Tin AX 6 (AtSignal) like we did in LTL 50 11
12 LTL vs. CTL Different models - A CTL tree defines a subset of models of LTL Expressivity Define LTL satisfied on Kripke model if satisfied by every path. For LTL both generate same paths A coin coin A coin B B C coffee tea coffee tea C D D E LTL cannot distinguish behaviors that generate same path, therefore cannot express possibility. CTL is sensitive to the branching structure Thus, it is always possible to get tea after inserting a coin is expressible in CTL: AG(coin EXtea) but not in LTL 12
13 LTL vs. CTL (II) p ~p p s 0 s 1 s 2 satisfies p but not AFAGp. -- no single F state Similarly, p q (p Op) not expressible in CTL 13
14 LTL vs. CTL (III) AGEFp - not expressible in LTL (a) S:{~p} S':{p} S:{~p} (b) Suppose A is equivalent to AGEFp - (a) satisfies AGEFp hence A - (b)-paths (a)-paths hence (b) satisfies A - However (b) does not satisfy AGEFp 14
15 CTL* Allows any LTL formula to be preceded by A or E. Exm. E(p Xq), A(Fq Gp) CTL* is more powerful then CTL and LTL but Model checking is PSPACE-complete in size of formula. 15
16 Model Checking Problem CTL Model Checking problem: Given a program model (S, s 0, R, L) and a CTL formula f, determine if s 0 f. Model-checking Satisfiability Semantic search: Given, M=(S,s 0,R,L), every formula is identified with the set of states that satisfy the formula (false, true S). So, given f, find the set S S of all states in S that satisfy f. Check if s 0 S. 16
17 Model Checking by Semantic Search Given (S, s 0, R,L), and f, find the set S S of all states in S that satisfy f. Simple for formulae: { s s p } = { s p L(s) } -- p atomic { s s f g } = { s s f } { s s g } { s s f } = S - { s s f } { s s EXf } = { s t S s.t. (s,t) R t f } The problem arises with A(qUr) and E(qUr). 17
18 Fix-points Fix-point: (x)=x Given a set S, a functional : 2 S 2 S is: - monotonic iff P Q [P] [Q] - -continuous iff P1 P2 [ Pi]= [Pi] - -continuous iff P1 P2 [ Pi]= [Pi] Theorem (Tarski) Monotonic have least and greatest fix-points: lfp( ) = {Z : [Z]=Z}, gfp( ) = {Z : [Z]=Z}, lfp( ) = i [ ], i=0,1, if is also -continuous gfp( ) = i [S], i=0,1, if is also -continuous 18
19 Fix-points of CTL Operators Lemma: EFf = f EX(Eff) (satisfied by same states) EFf is a fix-point of [Z] = f EX Z f EX Z is monotonic, -continuous and -continuous by Tarski: lfp(f EXZ) = (f EX false) I Lemma: EFf is a least fix-point of [Z] = f EX Z EFf = (f EX false) i 19
20 Fixpoints of CTL Operators (Clark-Emerson) [Z] g (f AXZ) g (f EXZ) f AXZ f EXZ lfp A[fUg] E[fUg] AFf EFf computation (g (f AX false)) i (g (f EX false)) i (f AX false) i (f EX false) i [Z] gfp computation f AXZ AGf (f AX true) i f EXZ EGf (f EX true) i where i S (S is finite) Recall AX(f) EX f 20
21 Example: EFp P the Kripke model P (false)= p EX false = p P 2 (false)= p EX p P 3 (false)= p EX(p EX p) 21
22 22 Example: EGy = (y EX true) i S6:{z} S7:{} S0:{x,y,z} S3:{x} S4:{y} S5:{x,z} S2:{y,z} S1:{x,y} [EG(y)] = [y] EX[S] = {s0,s1,s2,s4}=e0 [y] EX[E0]= {s0,s1,s2,s4} {s0,s2,s3,s4,s5,s6}= {s0,s2,s4}= E1 [y] EX[E1]= {s0,s1,s2,s4} {s0,s2,s3,s4,s6}= {s0,s2,s4}= E1
23 Example: EF(x=z y z) = ((x=z y z) EX false) i S6:{z} S7:{} S0:{x,y,z} S3:{x} S4:{y} S5:{x,z} S2:{y,z} S1:{x,y} [EF(x=z y z)] = [(x=z y z)] EX[ ] = {s4,s5}=e0 [E0] EX[E0]= {s4,s5} {s6}= {s4,s5,s6}= E1 (EX[E1]= {s6,s7})= {s4,s5,s6,s7}= E2 (EX[E2]= {s6,,s7,s5}) = {s4,s5,s6,s7} 23
24 Model Checking 24 Algorithm (sketch) 1. Construct A, the set of sub-formulae of f. 2. For i=1,, f, label every state s S with the sub-formulae of length i that are satisfied by s. 3. Check if s 0 is labeled by f. At stage i the algorithm employs the information gathered in earlier stages (in particular path formulae look at the information of the next states).
25 Model Checking Algorithm 25 Given M=(S, s 0, R, L), and a CTL formula f for j=0 to length(f) for each sub-formula g of f of length j case (-- structure of g) p: nothing (-- S is already labeled with propositions) q r: s S: if q L(s) and r L(s) then add q r to L(s) q: s S: if q L(s) then add q to L(s) EXq: s S: if t s.t. (s,t) R and q L(t) then add EXq to L(s) A(qUr): AU-check(q, r) E(qUr): EU-check(q, r) if f L(s 0 ) then output=true, else output=false.
26 Checking state satisfiability fro A(qUr), E(qUr) AU-check (q, r) for each s S, if r L(s) then add A(qUr) to L(s) for j=1 to S for each s S, if q L(s) and A(qUr) L(t) for all t s.t. (s,t) R then add A(qUr) to L(s) EU-check (q, r) for each s S, if r L(s) then add E(qUr) to L(s) for j=1 to S for each s S, if q L(s) and E(qUr) to L(t) for some t s.t. (s,t) R then add E(qUr) to L(s) Complexity: O( S 2 ) 26
27 Fairness Assumption Strong fairness: a transition that is enabled i.o. is taken i.o - LTL: ( ) - - private case, =True Weak fairness: a transition that is continuously enabled is taken i.o - LTL: ( ) Rule out traces that are unrealistic or provide for unfair service (starvation). (T_Red &P_Green) & (P_Red &T_Green) T_Red, P_Green T_Red, P_Red T_Green, P_Red Fairness assumptions are not in CTL
28 Fair Semantics for CTL Strong Fairness constraint: Sfair = i ( i i ) j ( j j ), i, i, j, j, CTL formulae. For a model M= (S, s I, R, L) and s S: FairPaths(s) = { Paths(s) Sfair } Fair semantics w.r.t. Sfair s F p iff s p s F f iff not s F f s F f g iff s F f and s F g s F Exf iff s. (s,s ) R and s f FairPaths(s), s F E[pUq] s F A[pUq] iff exists =(s 0, s 1, ) s.t s 0 =s, FairPaths(s), k 0. s k q i. 0 i k s i p iff for every =(s 0, s 1, ) s.t s 0 =s, FairPaths(s), k 0. s k q i. 0 i k s i p
29 Model Checking under Farness Constraints How to check: FairPaths(s)? Observation: FairPaths(s) iff j 0 j FairPaths( j ) Hence, redefine fair semantic: s F p iff s p s F f iff not s F f s F f g iff s F f and s F g s F Exf iff s. (s,s ) R and s f FairPaths(s ) s F A[fUg] iff for every path (s 0, s 1, ) s.t s 0 =s, k 0. s k g i. 0 i k s i f FairPaths(s k ) s F E[fUg] iff for some path (s 0, s 1, ) s.t s 0 =s, k 0. s k g i. 0 i k s i f FairPaths(s k )
30 Computation of FairPaths(s) Let: Sfair = ( ) where, are CTL formulae. Sfair iff k 0, n k, s.t. = s 0 s k-1 (s k s n ) and: k i n. s i or k j n. s j Computation of FairPaths(s) w.r.t. Sfair = ( ) For a model M= (S, s I, R, L): Let a, b, fair be new fresh variables Compute Sat( )={s S s } then s Sat( ). L(s):=L(s) {a} Compute Sat( )={s S s } then s Sat( ). L(s):=L(s) {b} Decompose M into a graph of maximal SCCs. For each SCC, if for all states s SCC, a L(s), or otherwise there exists a state s SCC s.t. b L(s ), mark the SCC as fair For each s S if there exists a path from s to a fair SCC then L(s) {fair}
31 Computation of FairPaths(s) Hence, redefine fair semantic: s F p iff s p s F f iff not s F f s F f g iff s F f and s F g s F Exf iff s. (s,s ) R and s (f fair) s F A[fUg] iff for every path (s 0, s 1, ) s.t s 0 =s, k 0. s k g i. 0 i k s i (f fair) s F E[fUg] iff for some path (s 0, s 1, ) s.t s 0 =s, k 0. s k g i. 0 i k s i (f fair) Thus, fair model checking requires pre-processing of the model that extends the states labeling, then normal model checking algorithm
32 Complexity For a model with N states and M transitions and a CTL formula f and a CTL fairness constraint, still linear time: O( f (N +M)). In the general case, with k fairness constraints, the labeling must be carried out separately for each constraint and the final labeling is the conjunction of the separate labeling. The complexity is then O( f (N +M) k)
33 RTCTL 33 A(qU k r) - at all paths r holds within k t.u. and q holds at all states until then. E(qU k r) - at some path r holds within k t.u. and q holds at all states until then. Semantics (fixed rate progress approach): s 0 A(qU k r) iff for every path ( s 0, s 1, ) i. 0 i k s i r j. 0 j i s j q s 0 E(qU k r) iff exists path ( s 0, s 1, ) and i 0. 0 i k s i r j. 0 j i s j q
34 Model Checking Algorithm for RTCTL Given M=(S, s 0, R, L), and a CTL formula f for j=0 to length(f) for each sub-formula g of f of length j case (structure of g) p:.. q r:.. q:.. EXq:.. A(qUr):.. A(qU k r): AU-check(min(k, S ), q, r) E(qUr):.. E(qU k r): EU-check(min(k, S ), q, r) if f L(s 0 ) then output=true, else output=false. 34
35 A(qU k r): 35 AU-check (max_len, q, r) -- max_len= min(k, S ) for each s S, if r L(s) then add A(qU 0 r) to L(s) for len=1 to max_len for each s S, if q L(s) and for every t such that (s,t) R there is j len-1 s.t. A(qU j r) L(t) then add A(qU len r) to L(s) for each s S, if A(qU j r) L(s) for some j max_len then replace by A(qU max_len r) to L(s) Note j<max_len can occur when S >k
36 E(qU k r): 36 EU-check (max_len, q, r) -- max_len= min(k, S ) for each s S, if r L(s) then add E(qU 0 r) to L(s) for len=1 to max_len for each s S, if q L(s) and E(qU len-1 r) L(t) for some t such that (s,t) R then add E(qU len r) to L(s) for each s S, if E(qU j r) L(s) for some j max_len then replace by E(qU max_len r) to L(s)
37 RTCTL (II) 37 In order to express fixed delays, we need: A(qU k r) - at all paths r holds at k t.u. and q holds at all states until then. E(qU k r) - at some path r holds at k t.u. and q holds at all states until then. Semantics (fixed rate progress approach): s 0 A(qU k r) iff for every path ( s 0, s 1, ) s k r j. 0 j k s j q s 0 E(qU k r) iff exists path ( s 0, s 1, ) and s k r j. 0 j k s j q Model checking same idea as for k
38 Railroad Crossing in Real-Time CTL Assertions: 50 seconds minimal delay between trains. AG(Tin EF 50 Tin) It takes a train 6 seconds to arrive at the signal AG(Tin AF 6 AtSignal) Train exits XR within 15 to 25 seconds. AG(((Twait AX( Twait)) AX(AtSignal Twait)) AG 16 Tout AF 26 Tout ) Requirements: Train at the signal is allowed to continue within 10 seconds. AG(AtSignal AF 5 ( Twait)) The gate is open whenever the crossing is empty for more than 10 seconds. AG( E(Tcr0U =10 Open)) 38
39 Symbolic Model Checking Symbolic representation with Boolean formulae of: the model (program) CTL formula thus avoiding the state explosion problem. Model Checking reduces to Boolean formulae manipulation. The idea: Given a model (S,R,L) over P (set of atomic propositions), Represent every state s S by a Boolean formula over P that is satisfied exactly by L(s) Represents R in terms of the Boolean formulas corresponding to source and destination states. 39
40 Program Representation - Example I S S' p S p S p R ( p p ) (p p ) (p p ) ( p p) p (p p ) p (p p ) (p p) (p p ) (p p ) 40
41 Program Representation - Example II 41 S0 S1 v 0 v 0 S3 S2 v 1 v 0,v 1 v 1 S0 (v 0 v 1 ), S1 v 0 v 1, S2 v 0 v 1, S3 v 0 v 1 R (v 0 ' v 0 ) (v 1 (v 0 v 1 ))
42 CTL Symbolic Representation p P, f, f g, are Boolean formulae. We show Boolean representation for: EXf, A[fUg], E[fUg] EXf Let v 1,,v n P be the atomic propositions in f, then: (v 1,,v n ).f = (a1,,a n ) {0,1} n f(a 1,,a n ) Then, EXf is represented by the formula (v 1 ',,v n ').(R f (v 1 ',,v n ') ) EX p = p'. R f(p ) = p'. (p p') p' = p'. (p p') = (p false) (p true) = p S S' p 42
43 S0 S1 v 0 v 0 S3 S2 v 1 v 0,v 1 v 1 EX(v 0 v 1 ) = (v 0 ', v 1 '). R (v 0 ' v 1 ') = (v 0 ', v 1 '). ( v 0 v 1 v 0 ' v 1 ') = (v 1 ').( v 0 v 1 false v 1 ') ( v 0 v 1 true v 1 ') = (v 1 '). ( v 0 v 1 v 1 ') = ( v 0 v 1 false) ( v 0 v 1 true) = ( v 0 v 1 ) 43
44 CTL Operators Representation For other CTL operators use their fixed point representation in terms of EX. S S' p Example: computation of EFp - recall EFp = i (false) where (y)= p EXy 1 (false) = p EXfalse = p 2 (false) = (p) = p EXp = p p'.(p p') p' = true 3 (false) = (true) = p EXtrue = true 44
45 Computation of EF(v 0 v 1 ) S0 S1 v 0 v 0 S3 S2 v 1 v 0,v 1 v 1 1 (false) = (v 0 v 1 ) EXfalse = (v 0 v 1 ) 2 (false) = (v 0 v 1 ) = (v 0 v 1 ) EX(v 0 v 1 ) = (v 0 v 1 ) ( v 0 v 1 ) = v 1 3 (false) = (v 1 ) = (v 0 v 1 ) EXv 1 = (v 0 v 1 ) 3 (false) = (v 0 v 1 ) = (v 0 v 1 ) EX(v 0 v 1 ) = true 45
46 Symbolic Model Checking Algorithm eval(f) { Case (f) p : return p g: return eval(g) g h: return eval(g) eval(h) EXg: return v'.(r p') E(gUh): return evaleu(eval(g),eval(h),false)) EGg: return evaleg(eval(g),true) } evaleu(p,q,y) { y'=q (p evalex(y)) if y'=y then return y else return evaleu(p.q.y') } evaleg(p,y) { y'=(p evalex(y)) if y'=y then return y else return evaleg(p.y') 46
47 Binary Decision Diagrams (BDD) Graphical representation of Boolean formulae obtained from ordered decision trees. a b b c c c c d d d d d d d d Ordered Decision Tree of a b c d 47
48 BDD Derivation Apply in bottom-up manner: Combine isomorphic sub-trees into a single tree Eliminate nodes whose left and right children are isomorphic Linear time Size of resulting graph depends on variable ordering 48
49 49 Example - Step 1: node elimination a b b c c d 0 1 d 0 1 d 0 1 d 0 1 d 0 1 d 0 1 d 0 1 d 0 1 c c
50 Example - Step 1: isomorphic trees 50 a 0 1 b b 0,1 0 1 c c 0,1 0 1 d d d 0, ,
51 Example - Step 1: Final BDD 51 a 1 0 b 0 1 c d
52 Properties of BDDs Canonical representation of formulae, enables simple comparison. Logical operators:,,, EX are computed w.r.t. BDD quadratic time. 52
Verification. Arijit Mondal. Dept. of Computer Science & Engineering Indian Institute of Technology Patna
IIT Patna 1 Verification Arijit Mondal Dept. of Computer Science & Engineering Indian Institute of Technology Patna arijit@iitp.ac.in Introduction The goal of verification To ensure 100% correct in functionality
More informationNPTEL Phase-II Video course on. Design Verification and Test of. Dr. Santosh Biswas Dr. Jatindra Kumar Deka IIT Guwahati
NPTEL Phase-II Video course on Design Verification and Test of Digital VLSI Designs Dr. Santosh Biswas Dr. Jatindra Kumar Deka IIT Guwahati Module IV: Temporal Logic Lecture I: Introduction to formal methods
More information3. Temporal Logics and Model Checking
3. Temporal Logics and Model Checking Page Temporal Logics 3.2 Linear Temporal Logic (PLTL) 3.4 Branching Time Temporal Logic (BTTL) 3.8 Computation Tree Logic (CTL) 3.9 Linear vs. Branching Time TL 3.16
More informationModel for reactive systems/software
Temporal Logics CS 5219 Abhik Roychoudhury National University of Singapore The big picture Software/ Sys. to be built (Dream) Properties to Satisfy (caution) Today s lecture System Model (Rough Idea)
More informationLecture 16: Computation Tree Logic (CTL)
Lecture 16: Computation Tree Logic (CTL) 1 Programme for the upcoming lectures Introducing CTL Basic Algorithms for CTL CTL and Fairness; computing strongly connected components Basic Decision Diagrams
More informationModel Checking with CTL. Presented by Jason Simas
Model Checking with CTL Presented by Jason Simas Model Checking with CTL Based Upon: Logic in Computer Science. Huth and Ryan. 2000. (148-215) Model Checking. Clarke, Grumberg and Peled. 1999. (1-26) Content
More informationCS357: CTL Model Checking (two lectures worth) David Dill
CS357: CTL Model Checking (two lectures worth) David Dill 1 CTL CTL = Computation Tree Logic It is a propositional temporal logic temporal logic extended to properties of events over time. CTL is a branching
More informationComputation Tree Logic
Computation Tree Logic Hao Zheng Department of Computer Science and Engineering University of South Florida Tampa, FL 33620 Email: zheng@cse.usf.edu Phone: (813)974-4757 Fax: (813)974-5456 Hao Zheng (CSE,
More informationModel Checking I. What are LTL and CTL? dack. and. dreq. and. q0bar
Model Checking I What are LTL and CTL? q0 or and dack dreq q0bar and 1 View circuit as a transition system (dreq, q0, dack) (dreq, q0, dack ) q0 = dreq and dack = dreq & (q0 + ( q0 & dack)) q0 or and D
More informationComputation Tree Logic (CTL)
Computation Tree Logic (CTL) Fazle Rabbi University of Oslo, Oslo, Norway Bergen University College, Bergen, Norway fazlr@student.matnat.uio.no, Fazle.Rabbi@hib.no May 30, 2015 Fazle Rabbi et al. (UiO,
More informationChapter 6: Computation Tree Logic
Chapter 6: Computation Tree Logic Prof. Ali Movaghar Verification of Reactive Systems Outline We introduce Computation Tree Logic (CTL), a branching temporal logic for specifying system properties. A comparison
More informationTemporal Logic. Stavros Tripakis University of California, Berkeley. We have designed a system. We want to check that it is correct.
EE 244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2016 Temporal logic Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 244, Fall 2016
More informationSummary. Computation Tree logic Vs. LTL. CTL at a glance. KM,s =! iff for every path " starting at s KM," =! COMPUTATION TREE LOGIC (CTL)
Summary COMPUTATION TREE LOGIC (CTL) Slides by Alessandro Artale http://www.inf.unibz.it/ artale/ Some material (text, figures) displayed in these slides is courtesy of: M. Benerecetti, A. Cimatti, M.
More information3-Valued Abstraction-Refinement
3-Valued Abstraction-Refinement Sharon Shoham Academic College of Tel-Aviv Yaffo 1 Model Checking An efficient procedure that receives: A finite-state model describing a system A temporal logic formula
More informationTemporal Logic Model Checking
18 Feb, 2009 Thomas Wahl, Oxford University Temporal Logic Model Checking 1 Temporal Logic Model Checking Thomas Wahl Computing Laboratory, Oxford University 18 Feb, 2009 Thomas Wahl, Oxford University
More informationComputation Tree Logic
Computation Tree Logic Computation tree logic (CTL) is a branching-time logic that includes the propositional connectives as well as temporal connectives AX, EX, AU, EU, AG, EG, AF, and EF. The syntax
More informationModel Checking I. What are LTL and CTL? dack. and. dreq. and. q0bar
Model Checking I What are LTL and CTL? and dack q0 or D dreq D q0bar and 1 View circuit as a transition system (dreq, q0, dack) (dreq, q0, dack ) q0 = dreq dack = dreq and (q0 or (not q0 and dack)) q0
More informationModel Checking. Temporal Logic. Fifth International Symposium in Programming, volume. of concurrent systems in CESAR. In Proceedings of the
Sérgio Campos, Edmund Why? Advantages: No proofs Fast Counter-examples No problem with partial specifications can easily express many concurrency properties Main Disadvantage: State Explosion Problem Too
More informationOverview. overview / 357
Overview overview6.1 Introduction Modelling parallel systems Linear Time Properties Regular Properties Linear Temporal Logic (LTL) Computation Tree Logic syntax and semantics of CTL expressiveness of CTL
More informationCTL Model Checking. Wishnu Prasetya.
CTL Model Checking Wishnu Prasetya wishnu@cs.uu.nl www.cs.uu.nl/docs/vakken/pv Background Example: verification of web applications à e.g. to prove existence of a path from page A to page B. Use of CTL
More informationPrinciples. Model (System Requirements) Answer: Model Checker. Specification (System Property) Yes, if the model satisfies the specification
Model Checking Princiles Model (System Requirements) Secification (System Proerty) Model Checker Answer: Yes, if the model satisfies the secification Counterexamle, otherwise Krike Model Krike Structure
More informationGuest lecturer: Prof. Mark Reynolds, The University of Western Australia
Università degli studi di Udine Corso per il dottorato di ricerca: Temporal Logics: Satisfiability Checking, Model Checking, and Synthesis January 2017 Lecture 01, Part 02: Temporal Logics Guest lecturer:
More informationModel Checking Algorithms
Model Checking Algorithms Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan November 14, 2018 Bow-Yaw Wang (Academia Sinica) Model Checking Algorithms November 14, 2018 1 / 56 Outline
More informationChapter 4: Computation tree logic
INFOF412 Formal verification of computer systems Chapter 4: Computation tree logic Mickael Randour Formal Methods and Verification group Computer Science Department, ULB March 2017 1 CTL: a specification
More informationLinear Temporal Logic (LTL)
Linear Temporal Logic (LTL) Grammar of well formed formulae (wff) φ φ ::= p (Atomic formula: p AP) φ (Negation) φ 1 φ 2 (Disjunction) Xφ (successor) Fφ (sometimes) Gφ (always) [φ 1 U φ 2 ] (Until) Details
More informationMODEL CHECKING. Arie Gurfinkel
1 MODEL CHECKING Arie Gurfinkel 2 Overview Kripke structures as models of computation CTL, LTL and property patterns CTL model-checking and counterexample generation State of the Art Model-Checkers 3 SW/HW
More informationMODEL-CHECKING IN DENSE REAL-TIME SHANT HARUTUNIAN
MODEL-CHECKING IN DENSE REAL-TIME SHANT HARUTUNIAN 1. Introduction These slides are for a talk based on the paper Model-Checking in Dense Real- Time, by Rajeev Alur, Costas Courcoubetis, and David Dill.
More informationFinite-State Model Checking
EECS 219C: Computer-Aided Verification Intro. to Model Checking: Models and Properties Sanjit A. Seshia EECS, UC Berkeley Finite-State Model Checking G(p X q) Temporal logic q p FSM Model Checker Yes,
More informationModel checking the basic modalities of CTL with Description Logic
Model checking the basic modalities of CTL with Description Logic Shoham Ben-David Richard Trefler Grant Weddell David R. Cheriton School of Computer Science University of Waterloo Abstract. Model checking
More informationComputation Tree Logic (CTL) & Basic Model Checking Algorithms
Computation Tree Logic (CTL) & Basic Model Checking Algorithms Martin Fränzle Carl von Ossietzky Universität Dpt. of Computing Science Res. Grp. Hybride Systeme Oldenburg, Germany 02917: CTL & Model Checking
More informationPSPACE-completeness of LTL/CTL model checking
PSPACE-completeness of LTL/CTL model checking Peter Lohmann April 10, 2007 Abstract This paper will give a proof for the PSPACE-completeness of LTLsatisfiability and for the PSPACE-completeness of the
More informationExplicit State Model Checking Algorithm for CTL. CSE 814 CTL Explicit-State Model Checking Algorithm
Explicit State Model Checking for CTL 1 CTL Model Checking Problem Given A model describing the behaviors of a system A set of specifications expressed in CTL ically Check that every behavior satisfies
More informationModel Checking: An Introduction
Model Checking: An Introduction Meeting 3, CSCI 5535, Spring 2013 Announcements Homework 0 ( Preliminaries ) out, due Friday Saturday This Week Dive into research motivating CSCI 5535 Next Week Begin foundations
More informationCTL Model checking. 1. finite number of processes, each having a finite number of finite-valued variables. Model-Checking
CTL Model checking Assumptions:. finite number of processes, each having a finite number of finite-valued variables.. finite length of CTL formula Problem:Determine whether formula f 0 is true in a finite
More informationLinear Temporal Logic (LTL)
Chapter 9 Linear Temporal Logic (LTL) This chapter introduces the Linear Temporal Logic (LTL) to reason about state properties of Labelled Transition Systems defined in the previous chapter. We will first
More informationComputation Tree Logic
Chapter 6 Computation Tree Logic Pnueli [88] has introduced linear temporal logic to the computer science community for the specification and verification of reactive systems. In Chapter 3 we have treated
More informationLinear-Time Logic. Hao Zheng
Linear-Time Logic Hao Zheng Department of Computer Science and Engineering University of South Florida Tampa, FL 33620 Email: zheng@cse.usf.edu Phone: (813)974-4757 Fax: (813)974-5456 Hao Zheng (CSE, USF)
More informationIntroduction to Model Checking
Introduction to Model Checking Fabio Somenzi Department of Electrical, Computer, and Energy Engineering University of Colorado at Boulder July 25, 2009 Outline 1 Introduction 2 Modeling Systems and Properties
More informationTimo Latvala. February 4, 2004
Reactive Systems: Temporal Logic LT L Timo Latvala February 4, 2004 Reactive Systems: Temporal Logic LT L 8-1 Temporal Logics Temporal logics are currently the most widely used specification formalism
More informationLinear Temporal Logic and Büchi Automata
Linear Temporal Logic and Büchi Automata Yih-Kuen Tsay Department of Information Management National Taiwan University FLOLAC 2009 Yih-Kuen Tsay (SVVRL @ IM.NTU) Linear Temporal Logic and Büchi Automata
More informationChapter 5: Linear Temporal Logic
Chapter 5: Linear Temporal Logic Prof. Ali Movaghar Verification of Reactive Systems Spring 94 Outline We introduce linear temporal logic (LTL), a logical formalism that is suited for specifying LT properties.
More informationModal and Temporal Logics
Modal and Temporal Logics Colin Stirling School of Informatics University of Edinburgh July 23, 2003 Why modal and temporal logics? 1 Computational System Modal and temporal logics Operational semantics
More informationVerification Using Temporal Logic
CMSC 630 February 25, 2015 1 Verification Using Temporal Logic Sources: E.M. Clarke, O. Grumberg and D. Peled. Model Checking. MIT Press, Cambridge, 2000. E.A. Emerson. Temporal and Modal Logic. Chapter
More informationIntroduction to Temporal Logic. The purpose of temporal logics is to specify properties of dynamic systems. These can be either
Introduction to Temporal Logic The purpose of temporal logics is to specify properties of dynamic systems. These can be either Desired properites. Often liveness properties like In every infinite run action
More informationTemporal logics and explicit-state model checking. Pierre Wolper Université de Liège
Temporal logics and explicit-state model checking Pierre Wolper Université de Liège 1 Topics to be covered Introducing explicit-state model checking Finite automata on infinite words Temporal Logics and
More informationModel checking (III)
Theory and Algorithms Model checking (III) Alternatives andextensions Rafael Ramirez rafael@iua.upf.es Trimester1, Oct2003 Slide 9.1 Logics for reactive systems The are many specification languages for
More informationDouble Header. Model Checking. Model Checking. Overarching Plan. Take-Home Message. Spoiler Space. Topic: (Generic) Model Checking
Double Header Model Checking #1 Two Lectures Model Checking SoftwareModel Checking SLAM and BLAST Flying Boxes It is traditional to describe this stuff (especially SLAM and BLAST) with high-gloss animation
More informationAlan Bundy. Automated Reasoning LTL Model Checking
Automated Reasoning LTL Model Checking Alan Bundy Lecture 9, page 1 Introduction So far we have looked at theorem proving Powerful, especially where good sets of rewrite rules or decision procedures have
More informationOverview. Discrete Event Systems Verification of Finite Automata. What can finite automata be used for? What can finite automata be used for?
Computer Engineering and Networks Overview Discrete Event Systems Verification of Finite Automata Lothar Thiele Introduction Binary Decision Diagrams Representation of Boolean Functions Comparing two circuits
More informationProbabilistic Model Checking Michaelmas Term Dr. Dave Parker. Department of Computer Science University of Oxford
Probabilistic Model Checking Michaelmas Term 2011 Dr. Dave Parker Department of Computer Science University of Oxford Overview Temporal logic Non-probabilistic temporal logic CTL Probabilistic temporal
More informationAlgorithms for Model Checking (2IW55)
Algorithms for Model Checking (2IW55) Lecture 2 Fairness & Basic Model Checking Algorithm for CTL and fair CTL based on strongly connected components Chapter 4.1, 4.2 + SIAM Journal of Computing 1(2),
More informationAlternating Time Temporal Logics*
Alternating Time Temporal Logics* Sophie Pinchinat Visiting Research Fellow at RSISE Marie Curie Outgoing International Fellowship * @article{alur2002, title={alternating-time Temporal Logic}, author={alur,
More informationTopics in Verification AZADEH FARZAN FALL 2017
Topics in Verification AZADEH FARZAN FALL 2017 Last time LTL Syntax ϕ ::= true a ϕ 1 ϕ 2 ϕ ϕ ϕ 1 U ϕ 2 a AP. ϕ def = trueu ϕ ϕ def = ϕ g intuitive meaning of and is obt Limitations of LTL pay pay τ τ soda
More informationFinite State Model Checking
Finite State Model Checking Finite State Model Checking Finite State Systems System Descrition A Requirement F CTL TOOL No! Debugging Information Yes, Prototyes Executable Code Test sequences Tools: visualstate,
More informationDecision Procedures for CTL
Decision Procedures for CTL Oliver Friedmann 1 Markus Latte 1 1 Dept. of Computer Science, Ludwig-Maximilians-University, Munich, Germany CLoDeM Edinburgh, 15 July 2010 Introduction to CTL Origin: Emerson
More informationT Reactive Systems: Temporal Logic LTL
Tik-79.186 Reactive Systems 1 T-79.186 Reactive Systems: Temporal Logic LTL Spring 2005, Lecture 4 January 31, 2005 Tik-79.186 Reactive Systems 2 Temporal Logics Temporal logics are currently the most
More informationA brief history of model checking. Ken McMillan Cadence Berkeley Labs
A brief history of model checking Ken McMillan Cadence Berkeley Labs mcmillan@cadence.com Outline Part I -- Introduction to model checking Automatic formal verification of finite-state systems Applications
More informationFirst-order resolution for CTL
First-order resolution for Lan Zhang, Ullrich Hustadt and Clare Dixon Department of Computer Science, University of Liverpool Liverpool, L69 3BX, UK {Lan.Zhang, U.Hustadt, CLDixon}@liverpool.ac.uk Abstract
More informationESE601: Hybrid Systems. Introduction to verification
ESE601: Hybrid Systems Introduction to verification Spring 2006 Suggested reading material Papers (R14) - (R16) on the website. The book Model checking by Clarke, Grumberg and Peled. What is verification?
More informationModel Checking & Program Analysis
Model Checking & Program Analysis Markus Müller-Olm Dortmund University Overview Introduction Model Checking Flow Analysis Some Links between MC and FA Conclusion Apology for not giving proper credit to
More informationBinary Decision Diagrams
Binary Decision Diagrams Literature Some pointers: H.R. Andersen, An Introduction to Binary Decision Diagrams, Lecture notes, Department of Information Technology, IT University of Copenhagen Tools: URL:
More informationFORMAL METHODS LECTURE V: CTL MODEL CHECKING
FORMAL METHODS LECTURE V: CTL MODEL CHECKING Alessandro Artale Faculty of Computer Science Free University of Bolzano Room 2.03 artale@inf.unibz.it http://www.inf.unibz.it/ artale/ Some material (text,
More informationTemporal & Modal Logic. Acronyms. Contents. Temporal Logic Overview Classification PLTL Syntax Semantics Identities. Concurrency Model Checking
Temporal & Modal Logic E. Allen Emerson Presenter: Aly Farahat 2/12/2009 CS5090 1 Acronyms TL: Temporal Logic BTL: Branching-time Logic LTL: Linear-Time Logic CTL: Computation Tree Logic PLTL: Propositional
More informationAutomata-based Verification - III
COMP30172: Advanced Algorithms Automata-based Verification - III Howard Barringer Room KB2.20: email: howard.barringer@manchester.ac.uk March 2009 Third Topic Infinite Word Automata Motivation Büchi Automata
More informationTheorem Proving beyond Deduction
Theorem Proving beyond Deduction Specification and Verification with Higher-Order Logic Arnd Poetzsch-Heffter (Slides by Jens Brandt) Software Technology Group Fachbereich Informatik Technische Universität
More informationLecture 2: Symbolic Model Checking With SAT
Lecture 2: Symbolic Model Checking With SAT Edmund M. Clarke, Jr. School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 (Joint work over several years with: A. Biere, A. Cimatti, Y.
More informationComputer Science Department Carnegie Mellon University Pittsburgh, PA 15213
Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 Abstract We investigate the expressive power of linear-time and branching-time tempora1logics as fragments of the logic CfL*.
More informationFORMAL METHODS LECTURE IV: COMPUTATION TREE LOGIC (CTL)
Alessandro Artale (FM First Semester 2007/2008) p. 1/37 FORMAL METHODS LECTURE IV: COMPUTATION TREE LOGIC (CTL) Alessandro Artale Faculty of Computer Science Free University of Bolzano artale@inf.unibz.it
More informationComputation Tree Logic
Comutation Tree Logic Finite State Model Checking of Branching Time Logic Kim Guldstrand Larsen BRICS@Aalborg 1 Tool Suort Finite State Systems System Descrition A Reuirement F CTL TOOL Course Objectives:
More informationPropositional Logic: Models and Proofs
Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505
More informationChapter 3: Linear temporal logic
INFOF412 Formal verification of computer systems Chapter 3: Linear temporal logic Mickael Randour Formal Methods and Verification group Computer Science Department, ULB March 2017 1 LTL: a specification
More informationFAIRNESS FOR INFINITE STATE SYSTEMS
FAIRNESS FOR INFINITE STATE SYSTEMS Heidy Khlaaf University College London 1 FORMAL VERIFICATION Formal verification is the process of establishing whether a system satisfies some requirements (properties),
More informationSMV the Symbolic Model Verifier. Example: the alternating bit protocol. LTL Linear Time temporal Logic
Model Checking (I) SMV the Symbolic Model Verifier Example: the alternating bit protocol LTL Linear Time temporal Logic CTL Fixed Points Correctness Slide 1 SMV - Symbolic Model Verifier SMV - Symbolic
More informationAutomata-based Verification - III
CS3172: Advanced Algorithms Automata-based Verification - III Howard Barringer Room KB2.20/22: email: howard.barringer@manchester.ac.uk March 2005 Third Topic Infinite Word Automata Motivation Büchi Automata
More informationSymmetry Reductions. A. Prasad Sistla University Of Illinois at Chicago
Symmetry Reductions. A. Prasad Sistla University Of Illinois at Chicago Model-Checking Concurrent PGM Temporal SPEC Model Checker Yes/No Counter Example Approach Build the global state graph Algorithm
More informationAbstractions and Decision Procedures for Effective Software Model Checking
Abstractions and Decision Procedures for Effective Software Model Checking Prof. Natasha Sharygina The University of Lugano, Carnegie Mellon University Microsoft Summer School, Moscow, July 2011 Lecture
More informationAn Introduction to Temporal Logics
An Introduction to Temporal Logics c 2001,2004 M. Lawford Outline Motivation: Dining Philosophers Safety, Liveness, Fairness & Justice Kripke structures, LTS, SELTS, and Paths Linear Temporal Logic Branching
More informationBoolean decision diagrams and SAT-based representations
Boolean decision diagrams and SAT-based representations 4th July 200 So far we have seen Kripke Structures 2 Temporal logics (and their semantics over Kripke structures) 3 Model checking of these structures
More informationMulti-Valued Symbolic Model-Checking
Multi-Valued Symbolic Model-Checking MARSHA CHECHIK, BENET DEVEREUX, STEVE EASTERBROOK AND ARIE GURFINKEL University of Toronto This paper introduces the concept of multi-valued model-checking and describes
More informationTemporal Logic. M φ. Outline. Why not standard logic? What is temporal logic? LTL CTL* CTL Fairness. Ralf Huuck. Kripke Structure
Outline Temporal Logic Ralf Huuck Why not standard logic? What is temporal logic? LTL CTL* CTL Fairness Model Checking Problem model, program? M φ satisfies, Implements, refines property, specification
More informationAn n! Lower Bound On Formula Size
An n! Lower Bound On Formula Size Micah Adler Computer Science Dept. UMass, Amherst, USA http://www.cs.umass.edu/ micah Neil Immerman Computer Science Dept. UMass, Amherst, USA http://www.cs.umass.edu/
More informationUndergraduate work. Symbolic Model Checking Using Additive Decomposition by. Himanshu Jain. Joint work with Supratik Chakraborty
Undergraduate work Symbolic Model Checking Using Additive Decomposition by Himanshu Jain Joint work with Supratik Chakraborty Organization of the Talk Basics Motivation Related work Decomposition scheme
More informationAutomata-Theoretic Model Checking of Reactive Systems
Automata-Theoretic Model Checking of Reactive Systems Radu Iosif Verimag/CNRS (Grenoble, France) Thanks to Tom Henzinger (IST, Austria), Barbara Jobstmann (CNRS, Grenoble) and Doron Peled (Bar-Ilan University,
More informationModel Checking for the -calculus. Paolo Zuliani , Spring 2011
Model Checking for the -calculus Paolo Zuliani 15-817, Spring 2011 Outline What is the -calculus? Semantics Model Checking algorithms [Other fixpoint theorems] The -calculus A language for describing properties
More informationCrash course Verification of Finite Automata CTL model-checking
Crash course Verification of Finite Automata CTL model-checking Exercise session - 07.12.2016 Xiaoxi He 1 Reminders Big picture Objective Verify properties over DES models Formal method Absolute guarantee!
More informationDigital Systems. Validation, verification. R. Pacalet January 4, 2018
Digital Systems Validation, verification R. Pacalet January 4, 2018 2/98 Simulation Extra design tasks Reference model Simulation environment A simulation cannot be exhaustive Can discover a bug Cannot
More informationSymbolic Trajectory Evaluation (STE): Orna Grumberg Technion, Israel
Symbolic Trajectory Evaluation (STE): Automatic Refinement and Vacuity Detection Orna Grumberg Technion, Israel Marktoberdort 2007 1 Agenda Model checking Symbolic Trajectory Evaluation Basic Concepts
More informationHomework 2: Temporal logic
ICS-E5010 Computer-Aided Verification and Synthesis, Spring 2016 Stavros Tripakis Homework 2: Temporal logic Assigned: January 20, 2016 Due: February 1, 2016 Total: 235 points. 1. (20 points) Two formulae
More informationAutomata, Logic and Games: Theory and Application
Automata, Logic and Games: Theory and Application 1. Büchi Automata and S1S Luke Ong University of Oxford TACL Summer School University of Salerno, 14-19 June 2015 Luke Ong Büchi Automata & S1S 14-19 June
More informationGuest lecturer: Mark Reynolds, The University of Western Australia
Università degli studi di Udine Laurea Magistrale: Informatica Lectures for April/May 2014 La verifica del software: temporal logic Lecture 05 CTL Satisfiability via tableau Guest lecturer: Mark Reynolds,
More informationEFFICIENT PREDICATE ABSTRACTION OF PROGRAM SUMMARIES
EFFICIENT PREDICATE ABSTRACTION OF PROGRAM SUMMARIES Arie Gurfinkel, Sagar Chaki and Samir Sapra Carnegie Mellon Uni In NFM11 Presented by Nimrod Partush OUTLINE Introduction Predicate Abstraction CEGAR
More informationAutomata-Theoretic LTL Model-Checking
Automata-Theoretic LTL Model-Checking Arie Gurfinkel arie@cmu.edu SEI/CMU Automata-Theoretic LTL Model-Checking p.1 LTL - Linear Time Logic (Pn 77) Determines Patterns on Infinite Traces Atomic Propositions
More informationLearning to Verify Branching Time Properties
Learning to Verify Branching Time Properties Abhay Vardhan and Mahesh Viswanathan Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, USA Abstract. We present a new model checking algorithm
More informationComp487/587 - Boolean Formulas
Comp487/587 - Boolean Formulas 1 Logic and SAT 1.1 What is a Boolean Formula Logic is a way through which we can analyze and reason about simple or complicated events. In particular, we are interested
More informationOn the Expressiveness and Complexity of ATL
On the Expressiveness and Complexity of ATL François Laroussinie, Nicolas Markey, Ghassan Oreiby LSV, CNRS & ENS-Cachan Recherches en vérification automatique March 14, 2006 Overview of CTL CTL A Kripke
More informationHow Vacuous is Vacuous?
How Vacuous is Vacuous? Arie Gurfinkel and Marsha Chechik Department of Computer Science, University of Toronto, Toronto, ON M5S 3G4, Canada. Email: {arie,chechik}@cs.toronto.edu Abstract. Model-checking
More informationFrom Liveness to Promptness
From Liveness to Promptness Orna Kupferman Hebrew University Nir Piterman EPFL Moshe Y. Vardi Rice University Abstract Liveness temporal properties state that something good eventually happens, e.g., every
More informationLTL Model Checking. Wishnu Prasetya.
LTL Model Checking Wishnu Prasetya wishnu@cs.uu.nl www.cs.uu.nl/docs/vakken/pv Overview This pack : Abstract model of programs Temporal properties Verification (via model checking) algorithm Concurrency
More informationCTL satisfability via tableau A C++ implementation
CTL satisfability via tableau A C++ implementation Nicola Prezza April 30, 2015 Outline 1 Introduction 2 Parsing 3 Data structures 4 Initial sets of labels and edges 5 Cull 6 Examples and benchmarks The
More informationBinary Decision Diagrams
Binary Decision Diagrams Binary Decision Diagrams (BDDs) are a class of graphs that can be used as data structure for compactly representing boolean functions. BDDs were introduced by R. Bryant in 1986.
More information