Model checking Duration Calculus: A practical approach

Formal Aspects of Computing

Volumn 20, Issue 4-5, 2008, Pages 481-505

  Meyer, Roland ^a   Faber, Johannes ^a   Hoenicke, Jochen ^b   Rybalchenko, Andrey ^c  

^a UNIVERSITY OF OLDENBURG   (Germany)

^b UNIVERSITY OF FREIBURG   (Germany)

^c MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

Author keywords

Case study; Duration Calculus; European Train Control System; Model checking; Real time systems; Timed automata; Verification

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CALCULATIONS; COMMUNICATION SYSTEMS; COMPUTER NETWORKS; DATA COMMUNICATION SYSTEMS; DIFFERENTIATION (CALCULUS); EVOLUTIONARY ALGORITHMS; FUNCTIONS; INFORMATION THEORY; MATHEMATICAL MODELS; REAL TIME SYSTEMS; SCHEDULING ALGORITHMS; SPECIFICATIONS; TOOLS; TRANSLATION (LANGUAGES);

(PL) PROPERTIES; (SEMI)AUTOMATA; AND REAL TIME; APPLIED (CO); AUTOMATED VERIFICATION; AUTOMATIC DECOMPOSITION; COMPOSITIONAL VERIFICATION; DISTRIBUTIVE LAWS; DURATION CALCULUS (DC); EUROPEAN TRAIN CONTROL SYSTEM (ETCS); INDUSTRIAL CASE STUDIES; MODEL-CHECKING TOOLS; PRACTICAL APPROACH; REAL-TIME SYSTEMS; REALISTIC APPLICATIONS; SAFETY PROPERTIES; TRANSLATION ALGORITHMS;

MODEL CHECKING;

EID: 46249117256     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/s00165-008-0082-7     Document Type: Article

References (40)

1. Aceto L, Bouyer P, Burgueño A, Larsen KG (2003) The power of reachability testing for timed automata. Theor Comput Sci 300(1-3): 411-475
2. Alur R, Dill DL (1994) A theory of timed automata. Theor Comput Sci 126(2): 183-235
3. Bouajjani A, Lakhnech Y, Robbana R (1995) From duration calculus to linear hybrid automata. In: Wolper P (eds) CAV, LNCS, vol 939. Springer, Heidelberg, pp 196-210
4. Ball T, Majumdar R, Millstein T, Rajamani S (2001) Automatic predicate abstraction of C programs. In: PLDI, volume 36 of ACM SIGPLAN Notices. ACM Press, New York, pp 203-213
5. Brückner I (2007) Slicing Concurrent Real-Time System Specifications for Verification. In: Davies J, Gibbons J(eds) Integrated Formal Methods, LNCS, vol 4591. Springer, Heidelberg, pp 54-74
6. Clarke EM, Grumberg O, Jha S, Lu Y, Veith H (2000) Counterexample-guided abstraction refinement. In: Emerson EA, Sistla AP(eds) CAV, LNCS, vol 1855. Springer, Heidelberg, pp 154-169
7. Cook B, Podelski A, Rybalchenko A (2005) Abstraction refinement for termination. In: SAS, LNCS, vol 3672. Springer, Heidelberg, pp 87-101
8. Dierks H, Lettrari M (2002) Constructing test automata from graphical real-time requirements. In: Damm W, Olderog E-R(eds) FTRTFT, LNCS, vol 2469. Springer, Heidelberg, pp 433-453
9. ECSAG. ERTMS/ETCS Functional requirements specification (1999)
10. ERTMS User Group, UNISIG. ERTMS/ETCS System requirements specification (2002)
11. Fränzle M, Hansen MR (2007) Deciding an interval logic with accumulated durations. In: TACAS, LNCS, vol 4424. Springer, Heidelberg, pp 201-215
12. Faber J, Jacobs S, Sofronie-Stokkermans V (2007) Verifying CSP-OZ-DC specifications with complex data types and timing parameters. In: Davies J, Gibbons J(eds) Integrated Formal Methods. LNCS, vol 4591. Springer, Heidelberg, pp 233-252
13. Fränzle M (2004) Model-checking dense-time duration calculus. Formal Asp Comput 16(2): 121-139
14. Graf S, Saidi H (1997) Construction of abstract state graphs with PVS. In: Grumberg O (ed.) CAV, vol 1254. Springer, Heidelberg, pages 72-83
15. Hansen M (2006) DC with nominals. Personal communication, March (2006)
16. Henzinger TA, Jhala R, Majumdar R, McMillan KL (2004) Abstractions from proofs. In: Jones ND, Leroy X(eds) POPL. ACM Press, New York, pp 232-244
17. Hermanns H, Jansen DN, Usenko YS (2005) From StoCharts to MoDeST: a comparative reliability analysis of train radio communications. In: WOSP. ACM Press, New York, pp 13-23
18. Hoenicke J, Maier P (2005) Model-checking of specifications integrating processes, data and time. In: Fitzgerald JS, Hayes IJ, Tarlecki A(eds) FM, LNCS, vol 3582. Springer, Heidelberg, pp 465-480
19. Hoenicke J, Meyer R, Faber J (2006) PEA toolkit home page. http://csd.informatik.uni-oldenburg.de/projects/epea.html
20. Hoenicke J, Olderog ER (2002) CSP-OZ-DC: A combination of specification techniques for processes, data and time. Nordic J Comput 9
21. Hoare CAR (1985) Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs
22. Hoenicke J (2006) Combination of Processes, Data, and Time. Ph.D. thesis, University of Oldenburg
23. Krishna SN, Pandya PK (2005) Modal strength reduction in quantified discrete duration calculus. In: Ramanujam R, Sen S(eds) FSTTCS, LNCS, vol 3821. Springer, Heidelberg, pp 444-456
24. McMillan KL Jr (2003) Interpolation and SAT-based model checking. In: Hunt WA Jr, Somenzi F(eds) CAV, LNCS, vol 2725. Springer, Heidelberg, pp 1-13
25. Meyer R, Faber J, Rybalchenko A (2006) Model checking duration calculus: A practical approach. In: Barkaoui K, Cavalcanti A, Cerone A(eds) ICTAC, LNCS, vol 4281. Springer, Heidelberg, pp 332-346
26. Pandya PK (2002) Interval duration logic: Expressiveness and decidability. ENTCS 65(6)
27. Platzer A (2007) Differential dynamic logic for verifying parametric hybrid systems. In: Olivetti N.(eds) TABLEAUX, LNCS, vol 4548. Springer, Heidelberg, pp 216-232
28. Podelski A, Rybalchenko A (2005) Transition predicate abstraction and fair termination. In: POPL. ACM Press, New York, pp 132-144
29. Podelski A, Rybalchenko A (2007) ARMC: the logical choice for software model checking with abstraction refinement. In: PADL, LNCS, vol 4281. Springer, Heidelberg, pp 245-259
30. Ravn AP (1994) Design of Embedded Real-Time Computing Systems. Ph.D. thesis, Technical University of Denmark
31. Roscoe AW (1998) Theory and Practice of Concurrency. Prentice Hall, Englewood Cliffs
32. Rybalchenko A, Sofronie-Stokkermans V (2007) Constraint solving for interpolation. In: VMCAI, LNCS, vol 4349. Springer, Heidelberg, pp. 346-362
33. Rybalchenko A (2007) ARMC. http://www.mpi-sws.mpg.de/~rybal/armc
34. Smith G (2000) The Object-Z Specification Language. Kluwer, Dordrecht
35. Uppaal home page. University of Aalborg and University of Uppsala. http://www.uppaal.com, 1995-2005
36. Vardi MY (1991) Verification of concurrent programs: The automata-theoretic framework. Ann Pure Appl Logic 51(1-2): 79-98
37. Vardi MY, Wolper P (1986) An automata-theoretic approach to automatic program verification. In: LICS. IEEE Computer Society, pp 332-344
38. Zhou C, Hansen MR (2004) Duration Calculus. Springer, Heidelberg
39. Zimmermann A, Hommel G (2005) Towards modeling and evaluation of ETCS real-time communication and operation. J Syst Softw 77(1): 47-54
40. Zhou C, Hansen MR, Sestoft P (1993) Decidability and undecidability results for duration calculus. In: Enjalbert P, Finkel A, Wagner KW(eds) STACS, LNCS, vol 665. Springer, Heidelberg, pp 58-68