Modeling, Verification, and Testing Using Timed and Hybrid Automata

Model-Based Design for Embedded Systems

Volumn , Issue , 2018, Pages 383-436

  Tripakis, Stavros ^a   Dang, Thao ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85135661773     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781315218823-23     Document Type: Chapter

References (112)

1. N. Abed, S. Tripakis, and J.-M. Vincent. Resource-aware verification using randomized exploration of large state spaces. In SPIN’08, Los Angeles, CA, LNCS, 5156, 2008.
2. K. Altisen and S. Tripakis. Implementation of timed automata: An issue of semantics or modeling? In P. Pettersson and W. Yi (editors), 3rd International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS’05), Uppsala, Sweden, LNCS, 3829:273-288, September 2005, Springer, Berlin, Heidelberg.
3. R. Alur. Timed automata. NATO-ASI 1998 Summer School on Verification of Digital and Hybrid Systems, 1998.
4. R. Alur, C. Courcoubetis, N. Halbwachs, D.L. Dill, and H. Wong-Toi. Minimization of timed transition systems. In Third Conference on Concurrency Theory CONCUR '92, Stony Brook, NY, LNCS, 630:340-354, 1992, Springer-Verlag, New York.
5. R. Alur, C. Courcoubetis, N. Halbwachs, T. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3-34, 1995.
6. R. Alur, C. Courcoubetis, T.A. Henzinger, and P.-H. Ho. Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In Hybrid Systems, pp. 209-229, 1992.
7. R. Alur, T. Dang, J. Esposito, Y. Hur, F. Ivan, C. Kumar, I. Lee, P. Mishra, G. Pappas, and O. Sokolsky. Hierarchical modeling and analysis of embedded systems. Proceedings of the IEEE, 91(1):11-28, 2003.
8. R. Alur, T. Dang, and F. Ivancic. Counter-example guided predicate abstraction of hybrid systems. Theoretical Computer Science (TCS), 354(2):250-271, 2006.
9. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
10. H. Anai and V. Weispfenning. Reach set computations using real quantifier elimination. In M.D. Di Benedetto and A. Sangiovanni-Vincentelli (editors), Hybrid Systems: Computation and Control, Rome, Italy, LNCS, 2034:63-75, 2001, Springer-Verlag, Berlin, Heidelberg.
11. E. Asarin, O. Bournez, T. Dang, and O. Maler. Approximate reachability analysis of piecewise-linear dynamical systems. In B. Krogh and N. Lynch (editors), Hybrid Systems: Computation and Control, Pittsburg, PA, LNCS, 1790:20-31, 2000, Springer-Verlag, Berlin, Heidelberg.
12. E. Asarin, T. Dang, and A. Girard. Hybridization methods for the analysis of nonlinear systems. Acta Informatica, 43(7):451-476, 2007.
13. E. Asarin, T. Dang, and O. Maler. The d/dt tool for verification of hybrid systems. In Computer Aided Verification, Copenhagen, Denmark, LNCS, 2404:365-370, 2002, Springer-Verlag, Berlin, Heidelberg.
14. E. Asarin and G. Schneider. Widening the boundary between decidable and unde- cidable hybrid systems. In CONCUR, Irno, Czech Republic, 2002.
15. J. Beck and W. W. L. Chen. Irregularities of distribution. In Acta Arithmetica, Cambridge, U.K., 1997. Cambridge University Press.
16. B. Berthomieu and M. Menasche. An enumerative approach for analyzing time Petri nets. IFIP Congress Series, 9:41-46, 1983.
17. A. Bhatia and E. Frazzoli. Incremental search methods for reachability analysis of continuous and hybrid systems. In HSCC, Philadelphia, PA, pp. 142-156, 2004.
18. S. Bornot, J. Sifakis, and S. Tripakis. Modeling urgency in timed systems. In W.P. de Roever, H. Langmaack, and A. Pnueli (editors), Compositionality: The Significant Difference, International Symposium (COMPOS’97), Bad Malente, Germany, LNCS, 1536:103-129, September 1998, Springer, Berlin, Heidelberg.
19. D. Bosnacki. Digitization of timed automata. In Proceedings of the Fourth International Workshop on Formal Methods for Industrial Critical Systems (FMICS '99), Berlin, Germany, pp. 283-302, 1999.
20. O. Botchkarev and S. Tripakis. Verification of hybrid systems with linear differential inclusions using ellipsoidal approximations. In B. Krogh and N. Lynch (editors), Hybrid Systems: Computation and Control, Pittsburg, PA, LNCS, 1790:73-88, 2000, Springer-Verlag, Berlin, Heidelberg.
21. O. Bournez, O. Maler, and A. Pnueli. Orthogonal polyhedra: Representation and computation. In F. Vaandrager and J. van Schuppen (editors), Hybrid Systems: Computation and Control, Bergen Dal, the Netherlands, LNCS, 1569:46-60, 1999, Springer-Verlag, Berlin, Heidelberg.
22. P. Bouyer. Forward analysis of updatable timed automata. Formal Methods in System Design, 24(3):281-320, 2004.
23. P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Are timed automata updatable? In CAV’00, Chicago, IL, LNCS, 1855, 2000.
24. M. Bozga, O. Maler, and S. Tripakis. Efficient verification of timed automata using dense and discrete time semantics. In L. Pierre and T. Kropf (editors), Correct Hardware Design and Verification Methods, 10th IFIP WG 10.5 Advanced Research Working Conference (CHARME '99), Bad Herrenalb, Germany, LNCS, 1703:125-141, September 1999, Springer, Berlin, Heidelberg.
25. M. Branicky, M. Curtiss, J. Levine, and S. Morgan. Sampling-based reachability algorithms for control and verification of complex systems. In Thirteenth Yale Workshop on Adaptive and Learning Systems, New Haven, CI, 2005.
26. K. Cerans and J. Viksna. Deciding reachability for planar multipolynomial systems. In Hybrid Systems, pp. 389-400, 1995.
27. A. Chutinan and B.H. Krogh. Verification of polyhedral invariant hybrid automata using polygonal flow pipe approximations. In F. Vaandrager and J. van Schuppen (editors), Hybrid Systems: Computation and Control, Bergen Dal, the Netherlands, LNCS, 1569:76-90, 1999, Springer-Verlag, Berlin, Heidelberg.
28. E. Clarke, A. Fehnker, Z. Han, B. Krogh, J. Ouaknine, O. Stursberg, and M. Theobald. Abstraction and counterexample-guided refinement in model checking of hybrid systems. International Journal of Foundations of Computer Science, 14(4):583-604, 2003.
29. T. Dang. Reachability-based technique for idle speed control synthesis. International Journal of Software Engineering and Knowledge Engineering IJSEKE, 15(2):397-404, 2005.
30. T. Dang and O. Maler. Reachability analysis via face lifting. In T.A. Henzinger and S. Sastry (editors), Hybrid Systems: Computation and Control, Berkeley, CA, LNCS, 1386:96-109, 1998, Springer-Verlag, Berlin, Heidelberg.
31. T. Dang and T. Nahhal. Using disparity to enhance test generation for hybrid systems. In TESTCOM/FATES, Tokyo, Japan, LNCS, 2008, Springer, Berlin, Heidelberg.
32. T. Dang and T. Nahhal. Model-based testing of hybrid systems. Technical report, Verimag, IMAG, November 2007.
33. C. Daws, A. Olivero, S. Tripakis, and S. Yovine. The tool KRONOS. In R. Alur, T.A. Henzinger, and E.D. Sontag (editors), Hybrid Systems III:Verification and Control, LNCS, 1066:208-219, 1996, Springer, New York.
34. C. Daws and S. Tripakis. Model checking of real-time reachability properties using abstractions. In B. Steffen (editor), Fourth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’98), Lisbon, Portugal, LNCS, 1384:313-329, 1998, Springer, Berlin, Heidelberg.
35. D. Dill. Timing assumptions and verification of finite-state concurrent systems. In J. Sifakis (editor), Automatic Verification Methods for Finite State Systems, Grenoble, France, LNCS, 407:197-212, 1989, Springer.
36. A. Donzé and O. Maler. Systematic simulation using sensitivity analysis. In HSCC, Gières, France, 174-189, 2007.
37. J. Esposito, J. W. Kim, and V. Kumar. Adaptive RRTs for validating hybrid robotic control systems. In Proceedings Workshop on Algorithmic Foundations of Robotics, Zeist, the Netherlands, July 2004.
38. J.C. Fernandez, C. Jard, T. Jéron, and G. Viho. Using on-the-fly verification techniques for the generation of test suites. In CAV’96, New Brunswick, NJ, LNCS, 1102, 1996, Springer.
39. G. Frehse, B. Krogh, R. Rutenbar, and O. Maler. Time domain verification of oscillator circuit properties. Electronics Notes on Theoretical Computer Science, 153(3):9-22, 2006.
40. A. Girard. Reachability of uncertain linear systems using zonotopes. In Hybrid Systems: Computation and Control, Zurich, Switzerland, LNCS, 3414:291-305, 2005, Springer, Berlin, Heidelberg.
41. A. Girard and C. Le Guernic. Zonotope/hyperplane intersection for hybrid systems reachability analysis. In Hybrid Systems: Computation and Control HSCC, St. Louis, MU, 2008, Springer, Berlin, Heidelberg.
42. A. Girard, C. Le Guernic, and O. Maler. Efficient computation of reachable sets of linear time-invariant systems with inputs. In Hybrid Systems:Computation and Control HSCC, Santa Barbara, CA, LNCS, 3927:257-271, 2006, Springer, Berlin, Heidelberg.
43. A. Girard and G. Pappas. Verification using simulation. In HSCC, Santa Barbara, CA, pp. 272-286, 2006.
44. P. Godefroid, N. Klarlund, and K. Sen. DART: Directed automated random testing. SIGPLAN Not. (PLDI’05), 40(6):213-223, 2005.
45. M.R. Greenstreet and I. Mitchell. Reachability analysis using polygonal projections. In F. Vaandrager and J. van Schuppen (editors), Hybrid Systems: Computation and Control, Bergen Dal, the Netherlands, LNCS, 1569:76-90, 1999, Springer-Verlag, Berlin, Heidelberg.
46. R. Grosu, X. Huang, S.A. Smolka, W. Tan, and S. Tripakis. Deep random search for efficient model checking of timed automata. In F. Kordon and O. Sokolsky (editors), Seventh Monterey Workshop on Composition of Embedded Systems, Paris, France, LNCS, 4888, October 2006, Springer.
47. T. Henzinger, P. Kopke, A. Puri, and P. Varaiya. What’s decidable about hybrid automata? In Journal of Computer and System Sciences, 373-382, 1995, ACM Press.
48. T. Henzinger, Z. Manna, and A. Pnueli. What good are digital clocks? In ICALP’92, Vienna, Austria, LNCS, 623, 1992.
49. T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193-244, 1994.
50. T.A. Henzinger, P.-H. Ho, and H. Wong-Toi. HyTech: A model checker for hybrid systems. Software Tools for Technology Transfer, 1:110-122, 1997.
51. G.J. Holzmann. An analysis of bitstate hashing. In Formal Methods in System Design, Kluwer, 3(3):287-305, 1998.
52. G.J. Holzmann. The Spin Model Checker-Primer and Reference Manual. Addison-Wesley, Reading, MA, 2004.
53. S. Iman and S. Joshi. The e-Hardware Verification Language. Springer, New York, 2004.
54. C. Jard and T. Jeron. Bounded-memory algorithms for verification on-the-fly. In CAV’91, Aalborg, Denmark, LNCS, 575, 1992, Springer, Berlin, Heidelberg.
55. A. A. Julius, G. E. Fainekos, M. Anand, I. Lee, and G. J. Pappas. Robust test generation and coverage for hybrid systems. In HSCC, Pisa, Italy, pp. 329-342, 2007.
56. J. Kapinski, B. Krogh, O. Maler, and O. Stursberg. On systematic simulation of open continuous systems. In HSCC, Prague, Czech Republic, pp. 283-297, 2003.
57. J. Kim, J. Esposito, and V. Kumar. Sampling-based algorithm for testing and validating robot controllers. International Journal of Robotics Research, 25(12):1257-1272, 2006.
58. D. E. Kirk. Optical control theory: An introduction. Dover Publications, May 2004.
59. M. Kloetzer and C. Belta. Reachability analysis of multi-affine systems. In Hybrid Systems: Computation and Control, Santa Barbara, CA, pp. 348-362, 2006, Springer, Berlin, Heidelberg.
60. M. Krichen and S. Tripakis. Conformance testing for real-time systems. Formal methods in system design, 34(3):238-304, 2009.
61. M. Krichen and S. Tripakis. Black-box conformance testing for real-time systems. In S. Graf and L. Mounier (editors), 11th International SPIN Workshop on Model Checking Software (SPIN’04), Barcelona, Spain, LNCS, 2989:109-126, April 2004, Springer, Berlin, Heidelberg.
62. M. Krichen and S. Tripakis. Real-time testing with timed automata testers and coverage criteria. In Y. Lakhnech and S. Yovine (editors), Joint International Conference on Formal Modelling and Analysis of Timed Systems and Formal Techniques in Real-Time and Fault-Tolerant Systems, FORMATS/FTRTFT 2004, Grenoble, France, LNCS, 3253:134-151, September 2004, Springer.
63. M. Krichen and S. Tripakis. State identification problems for timed automata. In F. Khendek and R. Dssouli (editors), 17th IFIP TC6/WG 6.1 International Conference on Testing of Communicating Systems (Test-Com’05), Montreal, QC, LNCS, 3502:175-191, May 2005, Springer, Berlin, Germany.
64. A. Kuehlmann, K. McMillan, and R. Brayton. Probabilistic state space search. In ICCAD’99, San Jose, CA, 574-579, 1999.
65. J. Kuffner and S. LaValle. RRT-connect: An efficient approach to singlequery path planning. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA’2000), San Francisco, CA, April 2000.
66. A. Kurzhanski and I. Valyi. Ellipsoidal Calculus for Estimation and Control. Birkhauser, Boston, MA, 1997.
67. A.B. Kurzhanski and P. Varaiya. Ellipsoidal techniques for reachability analysis. In Hybrid Systems: Computation and Control, Pittsburgh, PA, 2000.
68. A. A. Kurzhanskiy and P. Varaiya. Ellipsoidal toolbox (et). In Proceedings of the 45th IEEE Conference on Decision and Control, San Diego, CA, 2006.
69. M. Kvasnica, P. Grieder, M. Baoti, and M. Morari. Multi-parametric toolbox (mpt). In Hybrid Systems: Computation and Control, Philadelphia, PA, LNCS, 2993:448-462, 2004, Springer, Berlin, Heidelberg.
70. K. Larsen, P. Petterson, and W. Yi. Uppaal in a nutshell. Software Tools for Technology Transfer, 1(1/2):134-152, October, 1997.
71. S. LaValle and J. Kuffner. Rapidly-exploring random trees: Progress and prospects, 2000. In Workshop on the Algorithmic Foundations of Robotics.
72. S. LaValle. Planning Algorithms. Cambridge University Press, New York, 2006.
73. D. Lee and M. Yannakakis. Principles and methods of testing finite state machines - A survey. Proceedings of the IEEE, 84:1090-1126, 1996.
74. J. Lygeros, K. Johansson, S. Sastry, and M. Egerstedt. the existence of executions of hybrid automata. In IEEE Conference on Decision and Control, Phoenix, AZ, 1999.
75. M. Mihail and C. H. Papadimitriou. On the random walk method for protocol testing. In D. L. Dill (editor), Proceedings of the Sixth International Conference on Computer-Aided Verification CAV, Stanford, CA, LNCS, 818:132-141, 1994, Springer, London, U.K.
76. O. Maler and A. Pnueli. Reachability analysis of planar multilinear systems. In Proceedings of the 4th Computer-Aided Verification, Elounda, Greece, volume 697. Springer, 1993.
77. I. M. Mitchell and J. A. Templeton. A toolbox of Hamilton-Jacobi solvers for analysis of nondeterministic continuous and hybrid systems. In Hybrid Systems: Computation and Control, Zurich, Switzerland, LNCS. Springer-Verlag, 2005, to appear.
78. N. Kitchen and A. Kuehlmann. Stimulus generation for constrained random simulation. In ICCAD 2007, San Jose, CA, pp. 258-265, 2007.
79. T. Nahhal and T. Dang. Test coverage for continuous and hybrid systems. In CAV, Berlin, Germany, pp. 454-468, 2007.
80. X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. An approach to the description and analysis of hybrid systems. In Hybrid Systems, pp. 149-178, 1992.
81. J. Ouaknine and J. Worrell. Revisiting digitization, robustness, and decidability for timed automata. In LICS 2003, Ottawa, ON, 2003, IEEE CS Press, Washington, DC.
82. R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
83. G. Pappas, G. Lafferriere, and S. Yovine. A new class of decidable hybrid systems. In F. Vaandrager and J. van Schuppen (editors), Hybrid Systems: Computation and Control, Bergen Dal, the Netherlands, LNCS, 1569:29-31, 1999, Springer-Verlag, Berlin, Heidelberg.
84. R. Pelanek and I. Cerna. Enhancing random walk state space exploration. In Proc. of Formal Methods for Industrial Critical Systems (FMICS’05), Lisbon, Portugal, 98-105, 2005, ACM Press, New York.
85. E. Plaku, L. Kavraki, and M. Vardi. Hybrid systems: From verification to falsification. In W. Damm and H. Hermanns (editors), International Conference on Computer Aided Verification (CAV), Berlin, Germany, LNCS, 4590:468-481, 2007, Springer-Verlag, Heidelberg, Berlin, Germany.
86. S. Prajna and A. Jadbabaie. Safety verification of hybrid systems using barrier certificates. In R. Alur and G. J. Pappas (editors), Hybrid Systems:Computation and Control, Philadelphia, PA, LNCS, 2993:477-492, 2004, Springer, Berlin, Heidelberg.
87. S. Prajna, A. Papachristodoulou, P. Seiler, and P. A. Parrilo. SOSTOOLS:Sum of Squares Optimization Toolbox for MATLAB, 2004.
88. A. Puri. Dynamical properties of timed automata. Discrete Event Dynamic Systems, 10(1-2):87-113, 2000.
89. A. Puri and P. Varaiya. Decidability of hybrid systems with rectangular differential inclusions. In D. L. Dill (editor), Proceedings of the Sixth International Conference on Computer-Aided Verification CAV, Stanford, CA, LNCS, 818:95-104, 1994. Springer-Verlag, Berlin, Heidelberg.
90. S. Ratschan and Z. She. Safety verification of hybrid systems by constraint propagation-based abstraction refinement. ACM Transactions on Embedded Computer Systems, 6(1): 2007.
91. S. Sankaranarayanan, T. Dang, and F. Ivancic. Symbolic model checking of hybrid systems using template polyhedra. In TACAS’08 - Tools and Algorithms for the Construction and Analysis of Systems, Budapest, Hungary, 2008, Springer.
92. S. Shyam and V. Bertacco. Distance-guided hybrid verification with GUIDO. In DATE '06: Proceedings of the Conference on Design, Automation and Test in Europe, pp. 1211-1216. European Design and Automation Association, Munich, Germany, 2006.
93. J. Sifakis and S. Yovine. Compositional specification of timed systems. In 13th Annual Symposium on Theoretical Aspects of Computer Science, STACS’96, Grenoble, France, LNCS, 1046, 1996, Spinger-Verlag, Berlin, Heidelberg.
94. O. Stursberg and B. Krogh. Efficient representation and computation of reachable sets for hybrid systems. In Hybrid Systems: Computation and Control HSCC, Prague, Czech Republic, LNCS, 482-497, 2003, Springer, Berlin, Heidelberg.
95. L. Tan, J. Kim, O. Sokolsky, and I. Lee. Model-based testing and monitoring for hybrid embedded systems. In Proceedings of IEEE Internation Conference on Information Reuse and Integration (IRI’04), Los Vegas, NV, 2004.
96. A. Tiwari. Formal semantics and analysis methods for Simulink Stateflow models. Technical report, SRI International, 2002.
97. A. Tiwari and G. Khanna. Nonlinear systems: Approximating reach sets. In Hybrid Systems: Computation and Control, Philadelphia, PA, LNCS, 2993:600-614, 2004, Springer, Berlin, Heidelberg.
98. C. Tomlin, I. Mitchell, A. Bayen, and M. Oishi. Computational techniques for the verification of hybrid systems. Proceedings of the IEEE, 91(7):986-1001, 2003.
99. F. Torrisi and A. Bemporad. HYSDEL-A tool for generating computational hybrid models. IEEE Transactions on Control Systems Technology, 12(2):235-249, 2004.
100. J. Tretmans. Testing concurrent systems: A formal approach. In CONCUR’99, Eindhoven, the Netherlands, LNCS, 1664, 1999, Springer, Berlin, Heidelberg.
101. S. Tripakis. Checking Timed Büchi Automata Emptiness on Simulation Graphs. ACM Transactions on Computational Logic (to appear).
102. S. Tripakis. Fault diagnosis for timed automata. In W. Damm and E.-R. Olderog (editors), Formal Techniques in Real Time and Fault Tolerant Systems, Seventh International Symposium (FTRTFT’02), Oldenburg, Germany, LNCS, 2469:205-224, September 2002, Springer, Berlin, Heidelberg.
103. S. Tripakis. Folk theorems on the determinization and minimization of timed automata. Information Processing Letters, 99(6):222-226, September 2006.
104. S. Tripakis. What is resource-aware verification? Unpublished document, 2008. Available from the author’s web page.
105. S. Tripakis and C. Courcoubetis. Extending promela and spin for real time. In T. Margaria and B. Steffen (editors), Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems (TACAS’96), Passav, Germany, LNCS, 1055:329-348, March 1996, Springer, Berlin, Heidelberg.
106. S. Tripakis and S. Yovine. Analysis of timed systems using timeabstracting bisimulations. Formal Methods in System Design, 18(1):25-68, January 2001.
107. A. van der Schaft and H. Schumacher. An Introduction to Hybrid Dynamical Systems. LNCIS, 251, 2000, Springer, Berlin, Germany.
108. B. Wile, J. Goss, and W. Roesner. Comprehensive Functional Verification. Elsevier, San Francisco, CA, 2005.
109. M. De Wulf, L. Doyen, and J.-F. Raskin. Almost ASAP semantics: From timed models to timed implementations. In Hybrid Systems: Computation and Control (HSCC’04), Philadelphia, PA, LNCS, 2993, 2004, Springer, Berlin, Heidelberg.
110. M. Yannakakis and D. Lee. An efficient algorithm for minimizing realtime transition systems. In Fifth International Conference on Computer-Aided Verification, Elounda, Greece, LNCS, 697, June 1993.
111. J. Yuan, C. Pixley, and A. Aziz. Constraint-Based Verification. Springer, New York, 2006.
112. H. Zhu, P. Hall, and J. May. Software unit test coverage and adequacy. ACM Computing Surveys, 29(4):366-427, 1997.