Formal verification of timed systems: A survey and perspective

Proceedings of the IEEE

Volumn 92, Issue 8, 2004, Pages 1283-1305

  Wang, Farn ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Embedded systems; Formal methods; Formal verification; Models; Real time systems; Specification; Temporal logics; Theory; Tools

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; COMPUTERS; EMBEDDED SYSTEMS; FORMAL LOGIC; MATHEMATICAL MODELS; THEORY; VLSI CIRCUITS;

FORMAL METHODS; FORMAL VERIFICATION; REAL-TIME SYSTEMS; SPECIFICATION; TEMPORAL LOGICS;

REAL TIME SYSTEMS;

EID: 21244465901     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/JPROC.2004.831197     Document Type: Conference Paper

References (246)

1. M. Abadi and L. Lamport, "Conjoining specifications," ACM Trans. Program. Lang. Syst., vol. 17, pp. 507-534, 1995.
2. P. A. Abdulla, A. Bouajjani, and B. Jonsson, "On-the-fly analysis of systems with unbounded, lossy, FIFO channels," in Lecture Notes in Computer Science, Computer Aided Verification. Heidelberg, Germany: Springer-Verlag, 1998, vol. 1427, pp. 305-318.
3. P. A. Abdulla and A. Nylen, "Timed Petri nets and BQOs," in Lecture Notes in Computer Science, Applications and Theory of Petri Nets 2001. Heidelberg, Germany: Springer-Verlag, 2001, vol. 2075, pp. 53-70.
4. L. D. Alfaro, R. Alur, R. Grosu, T. A. Henzinger, M. Kang, R. Majumdar, F. Mang, C. Meyer-Kirsch, and B. Y. Wang. "Mocha: A model-checking tool that exploits design structure," in Proc. 23rd Int. Conf. Software Engineering (ICSE'01). pp. 835-836.
5. R. Alur, C. Courcoubetis, and D. L. Dill, "Model checking for real-time systems," in Proc. 5th Annu. IEEE Symp. Logic in Computer Science, 1990, pp. 414-425.
6. _, "Model checking for probabilistic real-time systems," in Lecture Notes in Computer Science, Automata, Languages and Programming. Heidelberg, Germany: Springer-Verlag, 1991, vol. 510, pp. 115-136.
7. 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 Lecture Notes in Computer Science, Hybrid Systems. Heidelberg, Germany: Springer-Verlag, 1993, vol. 736, pp. 209-229.
8. R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine, "The algorithmic analysis of hybrid systems," Theor. Comput. Sci., vol. 138, pp. 3-34, 1995.
9. R. Alur, T. Dang, J. Esposito, Y. Hur, F. Ivancic, V. Kumar, I. Lee, P. Mishra, G. Pappas, and O. Sokolsky, "Hierarchical modeling and analysis of embedded systems," Proc. IEEE, vol. 90, pp. 11-28, Jan. 2003.
10. R. Alur, T. Dang, and F. Ivancic, "Counter-example guided predicate abstraction of hybrid systems," in Lecture Notes in Computer Science, Tools and Algorithms for the Construction and Analysis of Systems. Heidelberg, Germany: Springer-Verlag, 2003, vol. 2619, pp. 208-223.
11. R. Alur and D. L. Dill, "Automata for modeling real-time systems," in Lecture Notes in Computer Science, Automata, Languages and Programming. Heidelberg, Germany: Springer-Verlag, 1990, vol. 443, pp. 322-335.
12. _, "A theory of timed automata," Theor. Comput. Sci., vol. 126, pp. 183-235, 1994.
13. R. Alur, K. Etessami, S. L. Torre, and D. Peled, "Parametric temporal logic for 'model measuring'," in Lecture Notes in Computer Science, Automata, Languages and Programming. Heidelberg, Germany: Springer-Verlag, 1999, vol. 1644, pp. 159-168.
14. R. Alur and R. Grosu, "Modular refinement of hierarchic reactive machines," in Proc. Annu. Symp. Principles of Programming Languages 2000, pp. 390-402.
15. R. Alur and T. A. Henzinger, "A really temporal logic," in Proc. 30th Annu. IEEE Symp. Foundations of Computer Science, 1989, pp. 164-169.
16. _, "Real-time logics: complexity and expressiveness," Information and Computation, vol. 104, pp. 35-77, 1993.
17. _, "Reactive modules," Formal Methods Syst. Design, vol. 15, pp. 7-48, 1999.
18. Preliminary version: Proc. 11th IEEE Logic in Computer Science 1996, pp. 207-218.
19. R. Alur, T. A. Henzinger, and P. H. Ho, "Automatic symbolic verification of embedded systems," IEEE Trans. Software Eng., vol. 22, pp. 181-201, Mar. 1996.
20. R. Alur, T. A. Henzinger, F. Mang, S. Qadeer, S. Rajamani, and S. Taşiran, "MOCHA: Modularity in model checking," in Lecture Notes in Computer Science, Computer Aided Verification. Heidelberg, Germany: Springer-Verlag, 1998, vol. 1427, pp. 521-525.
21. R. Alur, T. A. Henzinger, and M. Y. Vardi, "Parametric real-time reasoning," in Proc. 25th ACM Symp. Theory of Computing, 1993, pp. 592-601.
22. A. Annichini, E. Asarin, and A. Bouajjani, "Symbolic techniques for parametric reasoning about counter and clock systems," in Lecture Notes in Computer Science, Computer Aided Verification. Heidelberg, Germany: Springer-Verlag, 2000, vol. 1855.
23. _, "Symbolic verification of lossy channel systems: applications to the bounded retransmission protocol," in Lecture Notes in Computer Science, Tools and Analysis for the Construction of Analysis of Systems. Heidelberg, Germany: Springer-Verlag, 1999, vol. 1579.
24. A. Annichini, A. Bouajjani, and M. Sighireanu, "TReX: a tool for reachability analysis of complex systems," in Lecture Notes in Computer Science, Computer Aided Verification. Heidelberg, Germany: Springer-Verlag, 2001, vol. 2102.
25. M. Archer, "TAME: using PVS strategies for special-purpose theorem proving," Ann. Math. Artif. Intell., vol. 29, no. 1/4, pp. 201-232, Feb. 2001.
26. M. Archer and C. Heitmeyer, "TAME: A specialized specification and verification system for timed automata," presented at the Work-in-Progress (WIP) 17th IEEE Real-Time Systems Symp. (RTSS'96), Washington, DC, 1996.
27. E. Asarin, M. Bozga, A. Kerbrat, O. Maler, A. Pnueli, and A. Rasse, "Data-structures for the verification of timed automata," in Lecture Notes in Computer Science, Hybrid and Real-Time Systems, 1997, vol. 1201, pp. 346-360.
28. E. Asarin and O. Maler, "As soon as possible: time optimal control for timed automata," in Lecture Notes in Computer Science, Hybrid Systems: Computation and Control, F. Vaandrage and J. van Schuppen, Eds. Heidelberg, Germany: Springer-Verlag, 1999, vol. 1569, pp. 19-30.
29. E. Asarin, O. Maler, and A. Pnueli, "Symbolic controller synthesis for discrete and timed systems." in Lecture Notes in Computer Science, Hybrid Systems II, P. Antsaklis, W. Kohn, A. Nerode, and S. Sastry, Eds. Heidelberg, Germany: Springer-Verlag, 1995, vol. 999, pp. 1-20.
30. E. Asarin, O. Maler, A. Pnueli, and J. Sifakis, "Controller synthesis for timed automata." in Proc. IFAC Symp. System Structure and Control, 1998, pp. 469-474.
31. J. C. M. Baeten and J. A. Bergstra, "Real time process algebra with infinitesimals," in Algebra of Communicating Processes 1994, A. Ponse, C. Verhoef, and S. F. M. van Vlijmen, Eds., 1995, pp. 148-187.
32. _, "Discrete time process algebra: absolute time, relabive time, and parametric time," Fundam. Inform., vol. 29, no. 1/2, pp. 51-76, 1997.
33. J. C. M. Baeten and C. A. Middelburg, "Process algebra with timing: real time and discrete time," in Handbook of Process Algebra, J. A. Bergstra, A. Ponse, and S. A. Smolka, Eds. New York: Elsevier, 2001, ch. 10.
34. F. Balarin, "Approximate reachability analysis of timed automata," in Proc. IEEE Real-Time Systems Symp., 1996, pp. 52-61.
35. T. Ball, B. Cook, V. Levin, and S. K. Rajamani, "SLAM and static driver verifier: technology transfer of formal methods inside Microsoft," presented at the Integrated Formal Methods 2004 Conf., Canterbury, U.K.
36. G. Behrmann, P. Bouyer, E. Fleury, and K. G. Larsen, "Static guard analysis in timed automata verification," in Lecture Notes in Computer Science, Tools and Algorithms for the Construction and Analysis of Systems. Heidelberg, Germany: Springer-Verlag, 2003, vol. 2619, pp. 254-277.
37. G. Behrmann, K. G. Larsen, J. Pearson, C. Weise, and W. Yi, "Efficient timed reachability analysis using clock difference diagrams," in Lecture Notes in Computer Science, Computer Aided Verification. Heidelberg, Germany: Springer-Verlag, 1999, vol. 1633, pp. 341-353.
38. J. Bengtsson, W. O. D. Griffoen, K. J. Kristoffersen, K. G. Larsen, F. Larsson, P. Pettersson, and Y. Wang, "Verification of an audio protocol with bus collision using UPPAAL," in Lecture Notes in Computer Science, Computer Aided Verification. Heidelberg, Germany: Springer-Verlag, 1996, vol. 1102, pp. 244-256.
39. J. Bengtsson, B. Jonsson, J. Lilius, and W. Yi, "Partial order reductions for timed systems," in Lecture Notes in Computer Science, CONCUR'98. Heidelberg, Germany: Springer-Verlag, 1998, vol. 1466, pp. 485-500.
40. J. Bengtsson, K. Larsen, F. Larsson, P. Pettersson, and W. Yi, "UPPAAL - a tool suite for automatic verification of real-time systems," in Lecture Notes in Computer Science, Hybrid Control Systems. Heidelberg, Germany: Springer-Verlag, 1996, vol. 1066, pp.232-243.
41. L. Bening and H. Foster, Principles of Verifiable RTL Design, a Functional Coding Style Supporting Verification Processes in Verilog, 2nd ed. Norwood, MA: Kluwer, 2001.
42. Handbook of Logic and Language, J. v. Benthem and A. T. Meulen, Eds., North-Holland, 1997.
43. B. Berthomieu and M. Diaz, "Modeling and verification of time dependent systems using time Petri nets," IEEE Trans. Software Eng., vol. 17, pp. 259-273, Mar. 1991.
44. T. Bolognesi and E. Brinksma, "Introduction to the ISO specification language LOTOS," Comput. Netw. ISDN Syst., vol. 14, no. 1, pp. 25-29, 1987.
45. D. Bosscher, I. Polak, and F. Vaandrager, "Verification of an audio control protocol," in Lecture Notes in Computer Science, Formal Techniques in Real-Time and Fault-Tolerant Systems. Heidelberg, Germany: Springer-Verlag, 1994, vol. 863, pp. 170-192.
46. A. Bouajjani, S. Tripakis, and S. Yovine, "On-the-fly symbolic model-checking for real-time systems," in Proc. IEEE Real-Time Systems Symp., 1997, pp. 25-34.
47. P. Bouyer, "Untameable timed automata!," in Lecture Notes in Computer Science, STACS 2003. Heidelberg, Germany: Springer-Verlag, 2003, vol. 2607, pp. 620-631.
48. F. D. J. Bowden, "Modeling time in Petri nets," presented at the 2nd Australian-Japan Workshop Stochastic Models, 1996.
49. M. Bozga, C. Daws, and O. Maler, "Kronos: a model-checking tool for real-time systems," in Lecture Notes in Computer Science, Computer Aided Verification. Heidelberg, Germany: Springer-Verlag, 1998, vol. 1427, pp. 546-550.
50. B. Brandin and W. M. Wonham, "Supervisory control of timed discrete-event systems," IEEE Trans. Automat. Contr., vol. 39, pp. 329-342, Feb. 1994.
51. R. K. Brayton, G. D. Hachtel, A. Sangiovanni-Vincentelli, F. Somenzi, A. Aziz, S.-T. Cheng, S. Edwards, S. Khatri, Y. Kukimoto, A. Pardo, S. Qadeer, R. K. Ranjan, S. Sarwary, T. R. Shiple, G. Swamy, and T. Villa, "VIS: a system for verification and synthesis," in Lecture Notes in Computer Science, Computer Aided Verification. Heidelberg, Germany: Springer-Verlag, vol. 1102, pp. 332-334.
52. M. Brockmeyer, C. Heitmeyer, F. Jahanian, and B. Labaw, "A flexible, extensible simulation environment for testing real-time specifications," in Proc. IEEE Real-Time Technology and Applications Symp. 1997, pp. 125-135.
53. R. E. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Trans. Comput., vol. C-35, pp. 677-691, Aug. 1986.
54. 20 states and beyond," in Proc. IEEE Symp. Logic in Computer Science, 1990, pp. 428-439.
55. F. Cassez and F. Laroussinie, "Model-checking for hybrid systems by quotienting and constrains solving," in Lecture Notes in Computer Science, Computer Aided Verification. Heidelberg, Germany: Springer-Verlag, 2000, vol. 1855, pp. 373-388.
56. K. Čerāns, "Decidability of bisimulation equivalence for parallel timer processes," in Lecture Notes in Computer Science, Computer Aided Verification. Heidelberg, Germany: Springer-Verlag, 1992. vol. 663, pp. 302-315.
57. A. Cerone and A. Maggiolo-Schettini, "Time-based expressivity of time Petri nets for sytem specification," Theor. Comput. Sci., vol. 216, no. 1-2, pp. 1-53, 1999.
58. S. Chaki, E. M. Clarke, J. Ouaknine, N. Sharygina, and N. Sinha, "State/event-based software model checking," in Lecture Notes in Computer Science, Integrated Formal Methods. Heidelberg, Germany: Springer-Verlag, 2004, vol. 2999, pp. 128-147.
59. C.-L. Chang, R. C. Lee, and R. C.-T. Lee, Symbolic Logic and Mechanical Theorem Proving. New York: Academic, 1997.
60. L. Chen, "An interleaving model for real-time systems," in Lecture Notes in Computer Science, Logical Foundations of Computer Science. Heidelberg, Germany: Springer-Verlag, 1992, vol. 620, pp. 81-92.
61. E. M. Clarke and E. A. Emerson, "Design and synthesis of synchronization skeletons using branching-time temporal logic," in Lecture Notes in Computer Science, Logic of Programs. Heidelberg. Germany: Springer-Verlag, 1981, vol. 131, pp. 52-71.
62. E. M. Clarke, E. A. Emerson, and A. P. Sistla, "Automatic verification of finite-state concurrent systems using temporal-logic specifications," ACM Trans. Program. Lang. Syst., vol. 8, no. 2, pp. 244-263, 1986.
63. E. M. Clarke, A. Fehnker, Z. Man, B. Krogh, O. Stursberg, and M. Theobald, "Verification of hybrid systems based on counterexample-guided abstraction refinement," in Lecture Notes in Computer Science, Tools and Algorithms for the Construction and Analysis of Systems. Heidelberg, Germany: Springer-Verlag, 2003, vol. 2619, pp. 192-207.
64. E. M. Clarke, O. Grumberg, S. Jha, Y Lu, and H. Veith, "Counterexample-guided abstraction refinement for symbolic model-checking," J. Assoc. Comput. Mach., vol. 50, no. 5, pp. 752-794, Sept. 2003.
65. E. M. Clarke, O. Grumberg, M. Minea, and D. Peled, "State-space reduction using partial-ordering techniques," Int. J. Softw. Tools Technol. Transf., vol. 2, no. 3, pp. 279-287, 1999.
66. E. M. Clarke, O. Grumberg, and D. A. Peled, Model Checking, Cambridge, MA: MIT Press, 2001.
67. P. C. Clements, C. L. Heilmeyer, B. G. Labaw, and A. T. Rose, "MT: a toolset for specifying and analyzing real-lime systems," in Proc. IEEE Real-Time Systems Symp. 1993, pp. 12-22.
68. P. Cousot and R. Cousot, "Abstract interpretation: A unified lattice model for static analysis of programs of by construction or approximation of fixpoints," in Conf. Rec. 4th Annu. ACM Symp. Principles of Programming Languages, 1977, pp. 238-252.
69. _, "Abstract interpretation and application to logic programs," J. Logic Program., vol. 13, no. 2-3, pp. 103-179, 1992.
70. P. Cousot and N, Halbwachs, "Automatic discovery of linear restraints among variables of a program," presented at the 5th ACM Symp. Principles of Programming Languages, Tucson, AZ, 1978.
71. D. Cyrluk, P. Lincoln, and N. Shankar, "On Shostak's decision procedure for combinations fo theories," in Lecture Notes in Computer Science, Automated Deduction (CADE-13). Heidelberg, Germany: Springer-Verlag, 1996, vol. 1104, pp. 463-477.
72. P. R. D'Argenio, "Algebras and Automata for Timed and Stochastic Systems," Ph.D. dissertation, Dept. Comput. Sci., University of Twente, Enschede, The Netherlands, 1999.
73. W. Damm, B. Josko, and H. Hungar, "A compositional real-time Semantics of STATEMATE designs," in Lecture Notes in Computer Science, Compositionality: The Significant Difference. Heidelberg, Germany: Springer-Verlag, 1998, vol. 1536, pp. 186-238.
74. A. David and M. O. Möller, "From HUPPAAL to UPPAAL - A translation from heirarchical timed automata to flat timed automata," Dept. Comput. Sci., Aarhus Universitet, Aarhus, Denmark, Tech. Rep. BRICSRS-01 11, 2001.
75. J. Davies and S. Schneider, "A brief history of timed CSP," Theor. Comput. Sci., vol. 138, no, 2, pp. 243-271, 1995.
76. C. Daws, A. Olivero, S. Tripakis, and S. Yovine, "The tool KRONOS," in Lecture Notes in Computer Science, Hybrid Systems. Heidelberg, Germany: Springer-Verlag, 1996, vol. 1066, pp. 208-219.
77. C. Daws and S. Yovine, "Reducing the number of clock variables of timed automata," in Proc. IEEE Real-Time Systems Symp., 1996, pp. 73-81.
78. N. Dershowitz and J.-P. Jouannaud, Handbook of Theoretical Computer Science B: Formal Methods and Semantics, J. van Leeuwen, Ed. Amsterdam, The Netherlands: North-Holland, 1990, ch. 6, pp. 243-320.
79. D. L. Dill, "Timing assumptions and verification of finite-state concurrent systems," in Lecture Notes in Computer Science, Computer Aided Verification. Heidelberg, Germany: Springer-Verlag, 1989, vol. 407, pp. 197-212.
80. B. P. Douglass, Real-Time UML. Reading, MA: Addison-Wesley, 1998.
81. E. A. Emerson, "Temporal and modal logic," in Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Amsterdam, The Netherlands: Elsevier, vol. B, pp. 995-1072.
82. E. A. Emerson and J. Y. Halpern, ""Sometimes" and "not never" revisited: on branching versus linear time temporal logic," J. Assoc. Comput. Mach., vol. 33, no. 1, pp. 151-178, 1986.
83. E. A. Emerson and C.-L. Lei, "Modalities for model checking: branching time logic strikes back," in Science of Computer Programming 8. Amsterdam, The Netherlands: Elsevier Science Publishers B. V. (North-Holland), 1987, pp. 275-306.
84. E. A. Emerson, A. K. Mok, A. P. Sistla, and J. Srinivasan, "Quantitative temporal reasoning," J. Real Time Syst., vol. 4, pp. 331-352, 1992.
85. E. A. Emerson and A. P. Sistla, "Utilizing symmetry when model-checking under fairness assumptions: an automata-theoretic approach," ACM Trans. Program. Lang. Syst., vol. 19, no. 4, pp. 617-638, July 1997.
86. E. A. Emerson and R. J. Trefler, "Parametric quantitative temporal reasoning," in Proc. IEEE Symp. Logic in Computer Science, 1999, pp. 336-343.
87. J. Engblom, A. Ermedahl, M. Sjoedin, J. Gustafsson, and H. Hansson, "Worst-case execution-time analysis for embedded real-time systems," Int. J. Softw. Tools Technol. Transf., vol. 4, pp. 437-455, 2001.
88. J. Esparza, "Petri nets, commutative context-free grammers and basic parallel processes," in Lecture Notes in Computer Science, Fundamentals of Computation Theory. Heidelberg, Germany: Springer-Verlag, 1995, vol. 965, pp. 221-232.
89. T. Firley, M. Huhn, K. Diethers, T. Gehrke, and U. Goltz, "Timed sequence diagrams and tool-based analysis - a case study," in Lecture Notes in Computer Science, UML'99. Heidelberg, Germany: Springer-Verlag, 1999, vol. 1723, pp. 645-660.
90. Formal Systems (Europe) Ltd., Failure-Divergence Refinement - FDR2 User Manual. [Online], Available: http://www.fsel.com
91. S. J. Garland and N. A. Lynch, "The IDA language and toolset: Support for designing, analyzing, and building distributed systems," Massachusetts Inst. Technol., Cambridge, Tech. Rep. MIT/LCS/TR.
92. _, "Using I/O automata for developing distributed systems," in Foundations of Component-Based Systems, G. T. Leavens and M. Sitaraman, Eds. Cambridge, U.K.: Cambridge Univ. Press, 2000, ch. 13, pp. 285-312.
93. R. Gerth, R. Kuiper, D. Peled, and W. Penczek, "A partial order approach to branching time temporal logic model checking," in Proc. 3rd Israel Symp. Theory of Computing and Systems, 1995, pp. 130-139.
94. C. Ghezzi, D. Mandrioli, S. Morasca, and M. Pezze, "A unified high-level Petri net formalism for time-critical systems," IEEE Trans. Software Eng., vol. 17, pp. 160-172, Feb. 1991.
95. C. Girault and R. Valk, Petri Nets for Systems Engineering-A Guide to Modeling, Verification, and Applications. Berlin, Germany: Springer-Verlag, 2003.
96. P. Godefroid, Lecture Notes in Computer Science, Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Space Explosion Problem. Heidelberg, Germany: Springer-Verlag, 1996, vol. 1032.
97. M. J. C. Gordon, "HOL: a proof generating system for higher-order logic," in VLSI Specification, Verification, and Synthesis, G. Birtwistle and P. A. Subrahmanyam, Eds. Norwood, MA: Kluwer, 1988, pp. 73-128.
98. S. Greibach, "Remarks on blind and partially blind one-way multicounter machines," Theor. Comput. Sci., vol. 7, pp. 311-324, 1978.
99. J. F. Groote and J. P. Warners, "The prepositional formula checker Heer-Hugo," J. Automat. Reason., vol. 24, no. 1-2, pp. 101-125, Feb. 2000.
100. O. Grumberg and D. E. Long, "Model checking and modular verification," ACM Trans. Program. Lang. Syst., vol. 16, no. 3, pp. 843-871, 1994.
101. J. V. Guttag, J. J. Horning, S. J. Garland, K. D. Jones, A. Modet, and J. M. Wing, Larch: Languages and Tools for Formal Specification. New York: Springer-Verlag, 1993.
102. N. Halbwachs, "Détermination automatique de relations linéaire vérifiées par les variables d'un programme," Thèse de 3e cycle, University of Grenoble, Grenoble, France, 1979.
103. _, "Delay analysis in synchronous programs," in Lecture Notes in Computer Science, Computer Aided Verification. Heidelberg, Germany: Springer-Verlag, 1993, vol. 697, pp. 409-423.
104. D. Harel, "Statecharts: A visual formalism for complex systems," Sci. Comp. Program., vol. 8, no. 3, pp. 231-274, 1987.
105. D. Harel, H. Lachover, A. Naamad, and A. Pnueli, "Explicit clock temporal logic," in Proc. IEEE 5th Svmp. Logic in Computer Science, 1990, pp. 402-413.
106. C. Heitmeyer and N. A. Lynch, "The generalized railroad crossing - a case study in formal verification of real-time systems," in Proc. 15th IEEE Real-Time Systems Symp., 1994, pp. 120-131.
107. C. Heitmeyer and D. Mandrioli, Formal Methods for Real-Time Computing. New York: Wiley, 1996.
108. M. Hendriks and K. G. Larsen. (2002) Exact acceleration of real-time model checking. Electron. Notes Theor. Comput. Sci. [Online]. Available: http://www.elsevier.nl/locate/entcs/volume65.html
109. T. A. Henzinger, P. H. Ho, and H. Wong-Toi, "HyTech: a model-checker for hybrid systems," Int. J. Softw. Tools Technol. Transf., vol. 1, pp. 110-122, 1997.
110. T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya, "What's decidable about hybrid automata?," J. Comput. Syst. Sci., vol. 57, pp. 94-124, 1998.
111. Preliminary version: Proc. 27th Symp. Theory of Computing 1995, pp. 373-382.
112. T. A. Henzinger, O. Kupferman, and M. Y. Vardi, "A space-efficient on-th-fly algorithm for real-time model-checking," in Lecture Notes in Computer Science, CONCUR'96. Heidelberg, Germany: Springer-Verlag, 1996, vol. 1119, pp. 514-529.
113. T. A. Henzinger, Z. Manna, and A. Pnueli, "An interleaving model for real-time," in Proc. 5th Int. Conf. Information Technology, 1990, pp. 717-730.
114. _, "What good are digital clocks?," in Lecture Notes in Computer Science, Automata, Languages, and Programming. Heidelberg, Germany: Springer-Verlag, 1992, vol. 623, pp. 545-558.
115. T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, "Symbolic model checking for real-time systems," Inform. Comput., vol. 111, no. 2, pp. 193-244, 1994.
116. T. A. Henzinger, S. Qadeer, and S. Rajamani, "You assume, we guarantee: methodology and case studies," in Lecture Notes in Computer Science, Computer Aided Verification. Heidelberg, Germany: Springer-Verlag, 1998, vol. 1427, pp. 440-451.
117. C. A. R. Hoare, Communicating Sequential Processes. Englewood Cliffs, NJ: Prentice-Hall, 1985.
118. G. J. Holzmann and D. Peled, "An improvement in formal verification," in Proc. 7th IFIP WG6.1 Int. Conf. Formal Description Techniques, 1994, pp. 177-194.
119. J. Hooman, "Compositional verification of real-time applications," in Lecture Notes in Computer Science. Compositionality - The Significance Difference. Heidelberg, Germany: Springer-Verlag, 1998, vol. 1536, pp. 276-300.
120. P. Hopcroft and J. Pansiot, "On the reachability problem for 5-dimensional vector addition systems," Theoret. Comp. Sci., vol. 8, pp. 135-159, 1979.
121. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation. Reading, MA: Addison-Wesley, 1979.
122. P.-A. Hsiung and F. Wang, "User-friendly verification," presented at the 1999 IFIP TC6/WG6.1 Joint Int. Conf. Formal Description Techniques and Protocol Specification. Testing, and Verification, Beijing, China.
123. T. Hune, J. Romijn, M. Stoekinga, and F. Vaandrager, "Linear parametric model checking of timed automata," in Lecture Notes in Com puter Science, Tools and Algorithms for the Construction and Analysis of Systems. Heidelberg, Germany: Springer-Verlag, 2001, vol. 2031, pp. 189-203.
124. M. Huth, R. Jagadeesan, and D. Schmidt, "Modal transition systems: a foundation for three-valued program analysis," in Lecture Notes in Computer Science, Proc. European Symp. Programming 2001. Heidelberg, Germany: Springer-Verlag, 2001, vol. 2028, pp. 155-169.
125. ISO/IEC-JTCI/SC21/WG1/FDT/C:LOTOS, A Formal Description Technique Based on the Temporal Ordering of Observational Behavior, IS 8807, Feb. 1989.
126. ISO/IEC JTCI/SC33: ISO/IEC FCD 15437-Enhancements to LOTOS (E-LOTOS), ISO/IEC JTC1/SC33 N0188, May 1998.
127. F. Jananian, "Verifying properties of systems with variable timing constraints," in Proc. IEEE Real-Time Systems Symp. 1989, pp. 319-328.
128. F. Jahanian, R. S. Lee, and A. K. Mok, "Semantics of modechart in real-time logic," in Proc. 21st Hawaii Int. Conf. Systems Science 1988, pp. 479-489.
129. F. Jahanian and A. K. Mok, "Safety analysis of timing properties in real-time systems," IEEE Trans. Software Eng., vol. SE-12, pp. 890-904, Sept. 1986.
130. _, "Modechart: a specification language for real-time systems," IEEE Trans. Software Eng., vol. 20, pp. 933-947, Dec. 1994.
131. F. Jahanian and D. A. Stuart, "A method for verifying properties of modechart specifications," in Proc. IEEE Real-Time Systems Symp. 1988, pp. 12-21.
132. P. Jancar and F. Moller, "Checking regular properties of Petri nets," in Lecture Notes in Computer Science, CONCUR '95. Heidelberg, Germany: Springer-Verlag, 1995, vol. 962, pp. 348-362.
133. J. A. W. Kamp, "Tense logic and the theory of linear order," Ph.D. dissertation. Univ. California, Los Angeles, 1968.
134. R. M. Karp and R. E. Miller, "Parallel program schemata," J. Comput. Syst. Sci., vol. 3, pp. 147-195, 1969.
135. D. K. Kaynar, N. A. Lynch, R. Segala, and F. W. Vaandrager, "Timed I/O automata: a mathematical framework for modeling and analyzing real-time systems," presented at the 24th Int. Real-Time Systems Symp., Cancun, Mexico, 2003.
136. Full version: D. K. Kaynar, N. A. Lynch, R. Segala, and F. W. Vaandrager, "The theory of timed I/O automata, Massachusetts Inst. Technol. Lab. Comput. Sci., Cambridge, MA, Tech. Rep. MIT-LCS-TR-917.
137. E. Kindler and T. Vesper, "ESTL: a temporal logic for events and states," in Lecture Notes in Computer Science, Application and Theory of Petri Nets. Heidelberg, Germany: Springer-Verlag, 1998, vol. 1420, pp. 365-384.
138. J. W. Klop, Handbook of Logic in Computer Science, S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, Eds. Oxford, U.K.: Oxford Univ. Press, 1992, vol. 2, ch. 1, pp. 1-117.
139. A. Knapp, S. Merz, and C. Rauh, "Model checking timed UML state machines and collaborations," in Lecture Notes in Computer Science, Formal Techniques in Real-Time and Fault-Tolerant Systems. Heidelberg, Germany: Springer-Verlag, 2002, vol. 2469, pp. 395-414.
140. D. Kozen, "Results on the propositional mu-calculus," Theor. Comput. Sci., vol. 27, pp. 333-354, 1983.
141. R. Kurshan, V. Levin, M. Minea, D. Peled, and H. Yenigun, "Static partial order reduction," in Lecture Notes in Computer Science, Research and Development in Knowledge Discovery and Data Mining. Heidelberg, Germany: Springer-Verlag, 1998, vol. 1394, pp. 345-357.
142. M. Kwiatkowska, G. Norman, and D. Parker, "PRISM: probabilistic symbolic model-checker," in Lecture Notes in Computer Science, Computer Performance Evaluation. Heidelberg, Germany: Springer-Verlag, 2002, vol. 2324, pp. 200-204.
143. M. Kwiatkowska, G. Norman, R. Segala, and J. Sprotson, "Automatasic verification of real-time systems with discrete probability distributions," Theor. Comput. Sci., vol. 286, no. 1-2, 2002.
144. B. W. Lampson, N. A. Lynch, and J. F. Sogaard-Andersen, "Correctness of at-most-once message delivery protocols," in Proc. 6th IFIP Int. Conf. Formal Techniques for Networked and Distributed Systems, 1993, pp. 385-400.
145. F. Laroussinie and K. G. Larsen, "CMC: a tool for compositional model-checking of real-time systems," in Proc. IFIP TC6/WG6. I Joint Int. Conf. Formal Description Techniques and Protocol Specification, Testing, and Verification'98, pp. 439-456.
146. K. G. Larsen, F. Larsson, P. Pettersson, and Y. Wang, "Efficient verification of real-time systems: compact data-structure and state-space reduction," in Proc. IEEE Real-Time Systems Symp. 1998, pp. 14-24.
147. K. G. Larsen, P. Petterson, and W. Yi, "Compositional and symbolic model-checking of real-time systems," in Proc. IEEE Real-Time Systems Symp. 1995, pp. 76-87.
148. S. Lasota, "Decidability of strong bisimilarity for timed BPP," in Lecture Notes in Computer Science, CONCUR'02. Heidelberg, Germany: Springer-Verlag, 2002, vol. 2421, pp. 562-578.
149. L. Lavazza, G. Quaroni, and M. Venturelli, "Compiling UML and formal notations for modeling real-lime systems," presented at the 8th Eur. Conf. Software Engineering, Vienna, Austria, 2001.
150. M. Lawford, "Model reduction of discrete real-time systems," Ph.D. dissertation. Dept. Elect. Comput. Eng., Univ. Toronto, Toronto, ON, Canada, 1997.
151. M. Lawford, J. S. Ostroff, and W. M. Wonham, "Model reduction of modules for state-event temporal logics," in Proc. IFIP TC6/WG6.1 Joint Int. Conf. Formal Description Techniques and Protocol Specification, Testing, and Verification'96, pp. 263-278.
152. M. Lawford and W. M. Wonham, "Equivalence preserving transformations of timed transition models," IEEE Trans. Automat. Contr., vol. 40, pp. 1167-1179, July 1995.
153. G. Leduc and L. Leonard, "An introduction to ET-LOTOS for the description of time-sensitive systems," Comput. Netw. ISDN Syst., vol. 29, no. 3, pp. 271-292, 1997.
154. L. Leonard and G. Leduc, "A formal definition of time in LOTOS," Formal Aspects Comput., vol. 10, pp. 248-266, 1998.
155. I. Lee, P. Bremond-Gregoire, and R. Gerber, "A process algebraic approach to the specification and analysis of resource-bound real-time systems," Proc. IEEE, vol. 82, pp. 158-171, Jan. 1994.
156. H. Lin and W. Yi, "Axiomating timed automata," Acta Inform., vol. 38, no. 4, pp. 277-305, 2002.
157. V. Luchangco, E. Söylemez, S. Garland, and N. A. Lynch, "Verifying timing properties of concurrent algorithms," in Proc. 7th IFIP Conf. Formal Techniques, 1994, pp. 259-273.
158. N. A. Lynch, "Simulation techniques for proving properties of real-time systems," in Lecture Notes in Computer Science, A Decade of Concurrency: Reflections and Perspectives (REX School/Symposium, Noordwijkerhout, The Netherlands, June 1993). Heidelberg, Germany: Springer-Verlag, 1994, vol. 803, pp. 375-424.
159. _, Distributed Algorithms. San Mateo, CA: Morgan Kaufmann, 1995.
160. N. Lynch and M. R. Tuttle, "An introduction to input/output automata," CWI-Q., vol. 2, no. 3, pp. 219-246, Sept. 1989.
161. N. A. Lynch and F. W. Vaandrager, "Forward and backward simulations for timing-based systems," in Lecture Notes in Computer Science, Real Time: Theory in Practice 1991. Heidelberg, Germany: Springer-Verlag, 1992, vol. 600, pp. 397-446.
162. _, "Forward and backward simulations part II: Timing-based systems," CWI, Amsterdam, The Netherlands, Rep. CS-R9314, 1993.
163. N. A. Lynch and H. B. Weinberg, "Proving correctness of a vehicle maneuver: deceleration," in Proc. 2nd Eur. Workshop Real-Time and Hybrid Systems, 1995, pp. 196-203.
164. R. Mattolini and P. Nesi, "An interval logic for real-time system specification," IEEE Trans. Software Eng., vol. 27, pp. 208-227, Mar. 2001.
165. K. L. McMillan, "A compositional rule for hardware design refinement," in Lecture Notes in Computer Science, Computer Aided Verification. Heidelberg, Germany: Springer-Verlag, 1997, vol. 1254, pp. 24-35.
166. P. Merlin and D. J. Faber, "Recoverability of communication protocols - Implications of a theoretical study," IEEE Trans. Comput., vol. COM-24, pp. 1036-1043, Sept. 1976.
167. H. Miller and S. Katz, "Saving space by fully exploiting invisible transitions," Formal Methods Syst. Design, vol. 14, pp. 311-332, 1999.
168. R. Milner, Communication and Concurrency. Englewood Cliffs, NJ: Prentice-Hall, 1989.
169. M. Minea, "Partial order reduction for model-checking of timed automata," in Lecture Notes in Computer Science, CONCUR'99. Heidelberg, Germany: Springer-Verlag, 1999, vol. 1664, pp. 431-446.
170. M. O. Möller. (2002) Parking can get you there faster - Model augmentation to speed up real-time model checking. Electron. Notes Theor. Comput. Sci. [Online]. Available: http://wwwl.elsevier.com/gej-ng/31/29/23/117/ 51/show/Products/notes/index.htt
171. J. Møller, J. Lichtenberg, H. R. Andersen, and H. Hulgaard, "Difference decision diagrams," presented at the Annu. Conf. Eur. Assoc. Computer Science Logic (CSL), Madrid, Spain, 1999.
172. _, "Fully symbolic model-checking of timed systems using difference decision diagrams," presented at the Workshop on Symbolic Model-Checking (SMC), Trento, Italy, 1999.
173. F. Moller and C. Tofts, "A temporal calculus of communicating systems," in Lecture Notes in Computer Science, CONCUR'90. Heidelberg, Germany: Springer-Verlag, 1990, vol. 458, pp. 401-415.
174. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an efficient SAT solver," presented at the 39th Design Automation Conf., Las Vegas, NV, 2001.
175. D. Muthiayen, "Real-time reactive system development - A formal approach based on UML and PVS," Ph.D. dissertation, Concordia University, Montreal, QB, Canada, 2000.
176. G. Nelson and D. C. Oppen, "Simplification by cooperating decision procedures," ACM Trans. Program. Lang. Syst., vol. 1, no. 2, pp. 245-257, 1979.
177. R. De Nicola and F. Vaandrager, "Three logics for branching bisimulation," J. Assoc. Comput. Mach., vol. 42, no. 2, pp. 458-487, 1995.
178. X. Nicolin, J. Sifakis, and S. Yovine, "Compiling real-time specifications into extended automata," IEEE Trans. Software Eng. (Special Issue on Real-Time Systems), vol. 18, pp. 794-804, Sept. 1992.
179. T. Nipkow, L. C. Paulson, and M. Wenzel, Lecture Notes in Computer Science, Isabelle/HOL. Heidelberg, Germany: Springer-Verlag, 2003, vol. 2283.
180. 2pn upper bound on the complexity of Presburger arithmetic," J. Comp. Syst. Sci., vol. 16, pp. 323-332, 1978.
181. J. S. Ostroff, Temporal Logic of Real-Time Systems, ser. Advanced Software Development Series. New York: Wiley, 1990.
182. _, "Formal methods for the specification and design of real-time safety critical systems," J. Softw. Syst., vol. 18, no. 1, pp. 33-60, April 1992.
183. F. Pagani, "Partial orders and verification of real-lime systems," in Lecture Notes in Computer Science, Formal Techniques in Real-Time and Fault-Tolerant Systems. Heidelberg, Germany: Springer-Verlag, 1996, vol. 1135, pp. 327-346.
184. L. C. Paulson, "Isabelle: the next 700 theorem provers," in Logic and Computer Science, P. Odifreddi, Ed. New York: Academic, 1990, pp. 361-386.
185. D. Peled, "Combining partial order reductions with on-the-fly model checking," Formal Methods Syst. Design, vol. 8, pp. 39-64, 1996.
186. P. Pettersson and K. G. Larsen, "UPPAAL2k," Bull. Eur. Assoc. Theor. Comput. Sci., vol. 70, pp. 40-44, 2000.
187. A. Philippou, O. Sokolsky, R. Cleaveland, I. Lee, and S. Smolka, "Probabilistic resource failure in real-time process algebra," in Lecture Notes in Computer Science, CONCUR 98, 1998, vol. 1466, pp. 389-404.
188. A. Pnueli, "The temporal logic of programs," in Proc. 18th Annu. IEEE Symp. Foundations of Computer Science, 1977, pp. 45-57.
189. P. Ramadge and W. Wonham, "Supervisory control of a class of discrete event processes," SIAM J. Control Optim., vol. 25, pp. 206-230, 1987.
190. R. R. Razouk and C. V. Phelps, "Performance analysis using timed Petri nets," in Proc. 6th Protocol Specification, Testing, and Verification Conf., 1984, pp. 561-576.
191. G. M. Reed and A. W. Roscoe, "A timed model for communicating sequential processes," in Lecture Notes in Computer Science, Automata, Languages, and Programming. Heidelberg, Germany: Springer-Verlag, 1986, vol. 226, pp. 314-323,
192. J. Romijn, "A timed verification of the IEEE 1394 leader election protocol," in Proc. 4th Int. ERCIM Workshop Formal Methods for Industrial Critical Systems (FMICS'99), pp. 3-29.
193. A. Rose, M. Perez, and P. C. Clements, "Modechart toolset user's guide," Center Comput. High Assurance Syst., Naval Res. Lab., Washington, DC, Tech. Rep. NRL/MRL/5540-94-7427, 1994.
194. J. Rushby, "Theorem proving for verification," in Lecture Notes in Computer Science, Modeling and Verification of Parallel Processes. Heidelberg, Germany: Springer-Verlag, 2000, vol. 2067, pp. 39-57.
195. J. Rushby, S. Owre, and N. Shankar, "Subtypes for specifications: Predicate subtyping in PVS," IEEE Trans. Software Eng., vol. 24, pp. 709-720, Sept. 1998.
196. M. Schenke and E.-R. Olderog, "Transformational design of real-time systems - part I: From requirements to program specification," Acta Inform., vol. 36, no. 1, pp. 1-65, 1999.
197. S. Schneider, Concurrent and Real-Time Systems: The CSP Approach, New York: Wiley, 1999.
198. G. D. M. Serugendo, D. Mandrioli, D. Buchs, and N. Guelfi, "Real-time synchronized Petri nets," in Lecture Notes in Computer Science, Application and Theory of Petri Nets. Heidelberg, Germany: Springer-Verlag, 2002, vol. 2360, pp. 142-162.
199. S. A. Seshia and R. E. Bryant, "Unbounded, fully symbolic model checking of timed automata using Boolean methods," in Lecture Notes in Computer Science, Computer-Aided Verification, 2003, vol. 2725, pp. 154-166.
200. N. Shankar, "Verificatoin of real-time using PVS," in Lecture Notes in Computer Science, Computer Aided Verification. Heidelberg, Germany: Springer-Verlag, 1993, vol. 697, pp. 280-291.
201. A. Shaw, "Communicating real-time state machines," IEEE Trans. Software Eng., vol. 18, pp. 805-816, Sept. 1992.
202. R. E. Shostak, "On the SUP-INF method for proving Presburger formulas," J. Assoc. Comput. Mach., vol. 24, no. 4, pp. 529-543, Oct. 1977.
203. _, "An algorithm for reasoning about equality," Commun. ACM, vol. 21, no. 7, pp. 583-585, July 1978.
204. _, "Deciding linear inequalities by computing loop residues," J. Assoc. Comput. Mach., vol. 28, no. 4, pp. 769-779, Oct. 1981.
205. _, "Deciding combinations of theories," J. Assoc. Comput. Mach., vol. 31, no. 1, pp. 1-12, Jan. 1984.
206. D. P. L. Simons and M. I. A. Stoelinga, "Mechanical verification of the tree 1394a root contention protocol using uppaal2k," Comput. Sci. Inst. Nijmegen, Nijmegen, The Netherlands, Tech. Rep. CSI-R0009, 2000.
207. J. Sproston, "Decidable model-checking of probabilistic hybrid automata," in Lecture Notes in Computer Science, Formal Techniques in Real-Time and Fault-Tolerant Systems. Heidelberg, Germany: Springer-Verlag, 2000, vol. 1926, pp. 31-45.
208. E. W. Stark, "A proof technique for rely-guarantee properties," in Lecture Notes in Computer Science, Foundations of Software Technology and Theoretical Computer Science, 1985, vol. 206, pp. 369-391.
209. T. Stauner, O. Müller, and M. Fuchs, "Using HyTech to verify an automotive control system," in Lecture Notes in Computer Science, Hybrid and Real-Time Systems. Heidelberg, Germany: Springer-Verlag, 1997, vol. 1201, pp. 139-153.
210. O. Strichman, S. A. Seshia, and R. E. Bryant. "Deciding separation formulas with SAT," in Lecture Notes in Computer Science, Computer Aided Verification. Heidelberg, Germany: Springer-Verlag, 2002, vol. 2404, pp. 209-222.
211. D. A. Stuart, "Implementing a verifier for real-time systems," in Proc. IEEE Real Time Systems Symp. 1990, pp. 62-71.
212. S. Taşran, R. Alur, R. P. Kurshan, and R. K. Brayton, "Verifying abstractions of timed systems," in Lecture Notes in Computer Science, CONCUR'96. Heidelberg, Germany: Springer-Verlag, 1996, vol. 1119, pp. 546-562.
213. S. Tripakis and S. Yovine, "Analysis of timed systems using time-abstracting bisimulations," in Formal Methods Syst. Design, 2001, vol. 18, pp. 25-68.
214. F. Wang, "Parametric timing analysis for real-time systems," Inform. Comput., vol. 130, no. 2, pp. 131-150, Nov. 1996.
215. Preliminary version: Proc. 10th Symp. Logic in Computer Science 1996, pp. 112-122.
216. _, "High-level execution time analysis," in Lecture Notes in Computer Science, Formal Methods for Real-Time and Probabilistic Systems. Heidelberg, Germany: Springer-Verlag, 1997, vol. 1231, pp. 325-339.
217. _, "Efficient data-structure for fully symbolic verification of real-time software systems," in Lecture Notes in Computer Science, Tools and Algorithms for the Construction and Analysis of Systems. Heidelberg, Germany: Springer-Verlag, 2000, vol. 1785, pp. 157-171.
218. _, "Region encoding diagram for fully symbolic verification of real-time systems," in Proc. 24th Annu. Int. Computer Software and Applications Conf., Taipei, Taiwan, R.O.C., 2000, pp. 509-515.
219. _, "Parametric analysis of computer systems," Formal Methods Syst. Design, vol. 17, pp. 39-60, 2000.
220. _, "RED: model-checker for timed automata with clock-restriction diagram," presented at the Workshop on Real-Time Tools, Aalborg, Denmark, 2001.
221. _, "Symbolic verification of complex real-time systems with clock-restriction diagram," presented at the IFIP Int. Conf. Formal Techniques for Networked and Distributed Systems, Cheju Island, Korea, 2001.
222. _, "Symmetric model-checking of concurrent timed automata with clock-restriction diagram," presented at the Int. Conf. Real-Time and Embedded Computing Systems and Applications 2002, Tokyo, Japan.
223. _, "Efficient verification of timed automata with BDD-like data-structures." Int. J. Softw. Tools Technol. Transf. (Special Issue for VMCAI'2003).
224. Preliminary version: Lecture Notes in Computer Science, Verification, Model Checking, and Abstract Interpretation. Heidelberg. Germany: Springer-Verlag, 2003, vol. 2575.
225. _, "Model-checking distributed real-time systems with states, events, and multiple fairness assumptions," presented at the 10th Int. Conf. Algebraic Methodology and Software Technology. Stirling, U.K., 2004.
226. Preliminary version: Lecture Notes in Computer Science, Algebraic Methodology and Software Technology. Heidelberg, Germany: Springer-Verlag, 2004, vol. 3116.
227. _, "Symbolic parametric analysis of linear hybrid systems with BDD-like data-structures," presented at the 16th Computer Aided Verification Conf., Boston, MA, 2004.
228. Preliminary version: Lecture Notes in Computer Science, Computer Aided Verification. Heidelberg, Germany: Springer-Verlag, 2004, vol. 3114.
229. F. Wang and P.-A. Hsiung, "Automatic verification on the large," in Proc. 3rd IEEE High-Assurance Systems Engineering Symp., 1998, pp. 134-141.
230. _, "Efficient and user-friendly verification," IEEE Trans. Comput., vol. 51, pp. 61-83, Jan. 2002.
231. F. Wang, G.-D. Hwang, and F. Yu, "Symbolic simulation of industrial real-time and embedded systems - experiments with the blue-tooth baseband communication protocol," J. Embedded Comput., vol. I. no. I. 2004, to be published.
232. _, "TCTL inevitability analysis of dense-time systems," in Lecture Notes in Computer Science, Implementation and Application of Automata. Heidelberg, Germany: Springer-Verlag, 2003, vol. 2759, pp. 176-187.
233. _, "Numerical coverage estimation for the symbolic simulation of real-time systems," in Lecture Notes in Computer Science, Formal Techniques for Networked and Distributed Systems - FORTE 2003. Heidelberg, Germany: Springer-Verlag, 2003, vol. 2767, pp. 160-176.
234. F. Wang, A. Mok, and E. A. Emerson, "Symbolic model-checking for distributed real-time systems," in Lecture Notes in Computer Science, FME '93: Industrial-Strength Formal Methods. Heidelberg, Germany: Springer-Verlag, 1993, vol. 670, pp. 632-651.
235. F. Wang, A. K. Mok, and E. A. Emerson, "Real-time distributed system specification and verification in APTL," ACM Trans. Softw. Eng. Methodol., vol. 2, no. 4, pp. 346-378, Oct. 1993.
236. F. Wang and H.-C. Yen. "Parametric optimization of open real-time systems," in Lecture Notes in Computer Science, Static Analysis. Heidelberg, Germany: Springer-Verlag, 2001, vol. 2126, pp. 299-318.
237. _, "Reachability solution characterization of parametric real-time systems," Theor. Comput. Sci. (Special Issue for the 8th Conf. Implementation and Application of Automata), to be published.
238. H. Wong-Toi, "Symbolic Approximations for Verifying Real-Time Systems," Ph.D. dissertation, Stanford Univ., Stanford, CA, 1995.
239. S. Yamane, "Formal specification and verification method for hard real-time s7ystems," IPSJ J., vol. 42, no. 6, 2001.
240. J. Yang, A. K. Mok, and F. Wang, "Symbolic model-checking for event-driven real-time systems," ACM Trans. Program. Lang. Syst., vol. 19, no. 2, pp. 386-412, Mar. 1997.
241. W. Yi, "Real-time behavior of asynchronous agents," in Lecture Notes in Computer Science, CONCUR '90. Heidelberg, Germany: Springer-Verlag, 1990, vol. 458, pp. 502-520.
242. T. Yoneda and H. Schlingloff, "Efficient verification of parallel real-time systems," Formal Methods Syst. Design, vol. 11, no. 2, pp. 187-215, 1997.
243. T. Yoneda, A. Shibayama, B.-H. Schlingloff, and E. M. Clarke, "Efficient verification of parallel real-time systems," in Lecture Notes in Computer Science, Computer Aided Verification, 1993, vol. 697, pp. 321-332.
244. S. Yovine, "Kronos: A verification tool for real-time systems," Int. J. Softw. Tools Technol. Transf., vol. 1, no. 1/2. pp. 123-133, Oct 1997.
245. L. Zhang and S. Malik, "The quest for efficient Boolean satisfiability solvers," presented at the Int. Conf. Computer Aided Deduction (CADE 2002). Copenhagen, Denmark.
246. L. Zhang, C. Madigan, M. Moskewicz, and S. Malik, "Efficient conflict driven learning in a Boolean satisfiability solver," presented at the Int. Conf. Computer-Aided Design 2001, San Jose, CA.