On improving efficiency of model checking through systematically ...

More documents

Recommendations

Info

List of Tables 4.1 System characteristics . . . . . . . . . . . . . . . . . . . . . . 43 4.2 System physical size . . . . . . . . . . . . . . . . . . . . . . . 44 5.1 Time and memory usage of the verification on different abstract models of the algorithm . . . . . . . . . . . . . . . . . . 49 5.2 Comparison between three models . . . . . . . . . . . . . . . 51 5.3 Simulation data of the system in Figure 5.4 . . . . . . . . . . 53 x
Page 1 and 2: Master’s thesis On improving effi
Page 3 and 4: Abstract In this work, we aim at im
Page 5: Acknowledgements I wish to acknowle
Page 8 and 9: 3.4 Implementation . . . . . . . .
Page 13 and 14: List of Figures 1.1 A systematic ap
Page 15 and 16: Chapter 1 Introduction 1.1 Overview
Page 17 and 18: is very wide, the state space explo
Page 19 and 20: nbac-like concrete model Verificati
Page 21: 1.4 Outline This thesis reports our
Page 24 and 25: as: M = Var decl; Trans; Assert; In
Page 26 and 27: 2.1.4 Initial and final condition T
Page 28 and 29: like in PMC/Uppaal. Furthermore, se
Page 30 and 31: Nbac, we have to create the global
Page 32 and 33: not change because in those cases p
Page 35 and 36: Chapter 3 Connecting Nbac and PMC/U
Page 37 and 38: part (dataflow equations), meaning
Page 39 and 40: 1 As a consequence, the PMC XM
Page 41 and 42: if-then-else syntax. The above assi
Page 43 and 44: 2. The input graph computes input v
Page 45 and 46: Input graph (a1 ∨ (¬a2) ∨ (a1
Page 47 and 48: When applying the abovementioned pr
Page 49: 3.5 Summary In this chapter we have
Page 52 and 53: fixed point can be reached without
Page 54 and 55: start L2==0 start L1:=0 l2 l3 L2:=1
Page 56 and 57: 4.4 Subway system This case study i
Page 58 and 59: Table 4.2: System physical size Sys
Page 60 and 61:
out the problem characterization an
Page 62 and 63:
Since this case study is very small
Page 64 and 65:
the size of the state space based o
Page 66 and 67:
==0 b==1 modify modify b:=1 modify!
Page 68 and 69:
the reachable state space remains u
Page 71 and 72:
Chapter 6 Conclusions In this maste
Page 73 and 74:
asynchronous reader/writer algorith
Page 75:
integrate Nbac approach and PMC app
Page 78 and 79:
[12] Edmund M. Clarke, Orna Grumber
Page 80 and 81:
Appendix A Nbac input systems A.1 T
Page 82 and 83:
else false; lr’= if l6 then l6r e
Page 84 and 85:
else if wl11 and c1 then 1 else if
Page 86 and 87:
else if p1 and (l10 or l11) then 0
Page 88 and 89:
Appendix B Nbac output systems B.1
Page 90 and 91:
else 0; P_V211_nB_1’ = if (Init0)
Page 92 and 93:
not P_V36_nS-P_V211_nB_1+9>=0) or (
Page 94 and 95:
not PV217_retard_1 and B_0 and not
Page 96 and 97:
goto CS1 when k!=1 goto A1 } CS1 {
Page 98 and 99:
let (ast,nB,nS,diff,avance,retard)
Page 100 and 101:
Appendix D PMC XML model D.1 XML re
Page 102 and 103:
0 false s1 false s0 s0 s
show all

On improving efficiency of model checking through systematically ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?