Real-time system = discrete system + clock variables

International Journal on Software Tools for Technology Transfer

Volumn 1, Issue 1-2, 1997, Pages 86-109

  Alur, Rajeev ^a   Henzinger, Thomas A ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Clock variables; Real time programs; Real time systems; Semantics and verification

Indexed keywords

EMBEDDED CONTROLLERS; LANGUAGE CONSTRUCTS; MATHEMATICAL PRECISION; REAL TIME MODELING; REAL TIME PROGRAMMING; REAL TIME PROGRAMS; REAL-TIME APPLICATION; TIMING CONSTRAINTS;

AUTOMATA THEORY; BIBLIOGRAPHIC RETRIEVAL SYSTEMS; COMPUTER PROGRAMMING; MATHEMATICAL PROGRAMMING; MODEL CHECKING; REAL TIME SYSTEMS; SEMANTICS; TOOLS;

CLOCKS;

EID: 84896693448     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s100090050007     Document Type: Article

References (64)

1. E. Asarin, M. Bozga, A. Kerbrat, O. Maler, A. Pnueli, A. Rasse. Data structures for the verification of timed automata. In O. Maler, (ed.), HART 97: Hybrid and Real-time Systems, Lecture Notes in Computer Science 1201, pp. 346-360. Berlin Heidelberg New York: Springer-Verlag, 1997.
2. R. Alur, C. Courcoubetis, D. L. Dill. Model checking in dense real time. Information and Computation, 104(1): 2-34, 1993.
3. R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138: 3-34, 1995.
4. R. Alur, D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126: 183-235, 1994.
5. B. Alpern, A. J. Demers, F. B. Schneider. Safety without stuttering. Information Processing Letters, 23(4): 177-180, 1986.
6. R. Alur, L. Fix, T. A. Henzinger. A determinizable class of timed automata. In D. L. Dill, (ed.), CAV 94: Computer-aided Verification, Lecture Notes in Computer Science 818, pp. 1-13. Berlin Heidelberg New York: Springer-Verlag, 1994.
7. R. Alur, T. Feder, T. A. Henzinger. The benefits of relaxing punctuality. Journal of the ACM, 43(1): 116-146, 1996.
8. K. R. Apt, N. Francez, S. Katz. Appraising fairness in languages for distributed programming. Distributed Computing, 2(4): 226-241, 1988.
9. R. Alur, T. A. Henzinger. Logics and models of real time: a survey. In J. W. de Bakker, K. Huizing, W.-P. de Roever, G. Rozenberg, (eds.), Real Time: Theory in Practice, Lecture Notes in Computer Science 600, pp. 74-106. Berlin Heidelberg New York: Springer-Verlag, 1992.
10. R. Alur, T. A. Henzinger. A really temporal logic. Journal of the ACM, 41(1): 181-204, 1994.
11. R. Alur, T. A. Henzinger. Reactive modules. In Proceedings of the 11th Annual Symposium on Logic in Computer Science, pp. 207-218. IEEE Computer Society Press, 1996.
12. R. Alur, T. A. Henzinger. Modularity for timed and hybrid systems. In A. Mazurkiewicz and J. Winkowski, (eds.), CONCUR 97: Concurrency Theory, Lecture Notes in Computer Science 1243, pp. 74-88. Berlin Heidelberg New York: Springer-Verlag, 1997.
13. R. Alur, T. A. Henzinger, P.-H. Ho. Automatic symbolic verification of embedded systems. IEEE Transactions on Software Engineering, 22(3): 181-201, 1996.
14. R. Alur, T. A. Henzinger, E. D. Sontag, (eds.). Hybrid Systems III. Lecture Notes in Computer Science 1066. Berlin Heidelberg New York: Springer-Verlag, 1996.
15. R. Alur, A. Itai, R. P. Kurshan, M. Yannakakis. Timing verification by successive approximation. Information and Computation, 118(1): 142-157, 1995.
16. R. Alur, R. P. Kurshan. Timing analysis in Cospan. In R. Alur, T. A. Henzinger, E. D. Sontag, (eds.), Hybrid Systems III, Lecture Notes in Computer Science 1066, pp. 220-231. Berlin Heidelberg New York: Springer-Verlag, 1996.
17. M. Abadi, L. Lamport. Composing specifications. ACMTransactions on Programming Languages and Systems, 15(1): 73-132, 1993.
18. M. Abadi, L. Lamport. An old-fashioned recipe for real time. ACM Transactions on Programming Languages and Systems, 16(5): 1543-1571, 1994.
19. P. Antsaklis, A. Nerode, W. Kohn, S. Sastry, (eds.). Hybrid Systems II. Lecture Notes in Computer Science 999. Berlin Heidelberg New York: Springer-Verlag, 1995.
20. N. Bjørner, A. Browne, E. Chang, M. Colón, A. Kapur, Z. Manna, H. B. Sipma, T. E. Uribe. STeP: deductive-algorithmic verification of reactive and real-time systems. In R. Alur, T. A. Henzinger, (eds.), CAV 96: Computer-aided Verification, Lecture Notes in Computer Science 1102, pp. 415-418. Berlin Heidelberg New York: Springer-Verlag, 1996.
21. G. Berry, G. Gonthier. The synchronous programming language Esterel: design, semantics, implementation. Technical Report 842, INRIA, 1988.
22. J. Bengtsson, K. G. Larsen, F. Larsson, P. Pettersson, W. Yi. Uppaal: a tool-suite for automatic verification of real-time systems. In R. Alur, T. A. Henzinger, E. D. Sontag, (eds.), Hybrid Systems III, Lecture Notes in Computer Science 1066, pp. 232-243. Berlin Heidelberg New York: Springer-Verlag, 1996.
23. E. M. Clarke. E. A. Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Workshop on Logic of Programs, Lecture Notes in Computer Science 131, pp. 52-71. Berlin Heidelberg New York: Springer-Verlag, 1981.
24. E. M. Clarke, O. Grumberg, D. E. Long. Verification tools for finite-state concurrent systems. In A Decade of Concurrency: Reflections and Perspectives, Lecture Notes in Computer Science 803. Berlin Heidelberg New York: Springer-Verlag, 1994.
25. K. M. Chandy, J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.
26. P. A. D'Argenio, E. Brinksma. A calculus for timed automata. In B. Jonsson, J. Parrow, (eds.), FTRTFT 96: Formal Techniques in Real-time and Fault-tolerant Systems, Lecture Notes in Computer Science 1135, pp. 110-129. Berlin Heidelberg New York: Springer-Verlag, 1996.
27. J. W. de Bakker, K. Huizing, W.-P. de Roever, G. Rozenberg, (eds.). Real Time: Theory in Practice. Lecture Notes in Computer Science 600. Berlin Heidelberg New York: Springer-Verlag, 1992.
28. E. W. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9): 569, 1965.
29. E. W. Dijkstra. Guarded commands, nondeterminacy, and formal derivation of programs. Communications of the ACM, 18(8): 453-457, 1975.
30. D. L. Dill. Timing assumptions and verification of finite-state concurrent systems. In J. Sifakis, (ed.), CAV 89: Automatic Verification Methods for Finite-state Systems, Lecture Notes in Computer Science 407, pp. 197-212. Berlin Heidelberg New York: Springer-Verlag, 1989.
31. D. L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-independent Circuits. MIT Press, 1989.
32. C. Daws, A. Olivero, S. Tripakis, S. Yovine. The tool Kronos. In R. Alur, T. A. Henzinger, E. D. Sontag, (eds.), Hybrid Systems III, Lecture Notes in Computer Science 1066, pp. 208-219. Berlin Heidelberg New York: Springer-Verlag, 1996.
33. D. L. Dill, H. Wong-Toi. Verification of real-time systems by successive over-and underapproximation. In P. Wolper, (ed.), CAV 95: Computer-aided Verification, Lecture Notes in Com puter Science 939, pp. 409-422. Berlin Heidelberg New York: Springer-Verlag, 1995.
34. E. A. Emerson. Alternative semantics for temporal logics. Theoretical Computer Science, 26(1): 121-130, 1983.
35. R. L. Grossman, A. Nerode, A. P. Ravn, H. Rischel, (eds.). Hybrid Systems I. Lecture Notes in Computer Science 736. Berlin Heidelberg New York: Springer-Verlag, 1993.
36. R. Gawlick, R. Segala, J. F. Sogaard-Andersen, N. A. Lynch. Liveness in timed and untimed systems. In S. Abiteboul, E. Shamir, (eds.), ICALP 94: Automata, Languages, and Programming, Lecture Notes in Computer Science 820, pp. 166-177. Berlin Heidelberg New York: Springer-Verlag, 1994.
37. N. Halbwachs. Synchronous Programming of Reactive Systems. Kluwer Academic Publishers, 1993.
38. T. A. Henzinger. Sooner is safer than later. Information Processing Letters, 43(3): 135-141, 1992.
39. T. A. Henzinger. Hybrid automata with finite bisimulations. In Z. Fülöp, F. Gécseg, (eds.), ICALP 95: Automata, Languages, and Programming, Lecture Notes in Computer Science 944, pp. 324-335. Berlin Heidelberg New York: Springer-Verlag, 1995.
40. T. A. Henzinger. The theory of hybrid automata. In Proceedings of the 11th Annual Symposium on Logic in Computer Science, pp. 278-292. IEEE Computer Society Press, 1996.
41. T. A. Henzinger, P.-H. Ho, H. Wong-Toi. HyTech: a model checker for hybrid systems. In O. Grumberg, (ed.), CAV 97: Computer-aided Verification, Lecture Notes in Computer Science 1254, pp. 460-463. Berlin Heidelberg New York: Springer-Verlag, 1997.
42. C. L. Heitmeyer, R. D. Jeffords, B. G. Labaw. A benchmark for comparing different approaches for specifying and verifying real-time systems. In Proceedings of the Tenth International Workshop on Real-time Operating Systems and Software, 1993.
43. T. A. Henzinger, P. W. Kopke. Verification methods for the divergent runs of clock systems. In H. Langmaack, W.-P. de Roever, J. Vytopil, (eds.), FTRTFT 94: Formal Techniques in Real-time and Fault-tolerant Systems, Lecture Notes in Computer Science 863, pp. 351-372. Berlin Heidelberg New York: Springer-Verlag, 1994.
44. T. A. Henzinger, P. W. Kopke. Discrete-time control for rectangular hybrid automata. In P. Degano, R. Gorrieri, A. Marchetti-Spaccamela, (eds.), ICALP 97: Automata, Languages, and Programming, Lecture Notes in Computer Science 1256, pp. 582-593. Berlin Heidelberg New York: Springer-Verlag, 1997.
45. T. A. Henzinger, P. W. Kopke, A. Puri, P. Varaiya. What's decidable about hybrid automata? In Proceedings of the 27th Annual Symposium on Theory of Computing, pp. 373-382. ACM Press, 1995.
46. T. A. Henzinger, P. W. Kopke, H. Wong-Toi. The expressive power of clocks. In Z. Fülöp and F. Gécseg, (eds.), ICALP 95: Automata, Languages, and Programming, Lecture Notes in Computer Science 944, pp. 417-428. Berlin Heidelberg New York: Springer-Verlag, 1995.
47. T. A. Henzinger, Z. Manna, A. Pnueli. Temporal proof methodologies for timed transition systems. Information and Computation, 112(2): 273-337, 1994.
48. T. A. Henzinger, X. Nicollin, J. Sifakis, S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2): 193-244, 1994.
49. P.-H. Ho, H. Wong-Toi. Automated analysis of an audio control protocol. In P. Wolper, (ed.), CAV 95: Computer-aided Verification, Lecture Notes in Computer Science 939, pp. 381-394. Berlin Heidelberg New York: Springer-Verlag, 1995.
50. T. A. Henzinger, H. Wong-Toi. Using HyTech to synthesize control parameters for a steam boiler. In J.-R. Abrial, E. Börger, H. Langmaack, (eds.), Formal Methods for Industrial Applications: Specifying and Programming the Steam Boiler Control, Lecture Notes in Computer Science 1165, pp. 265-282. Berlin Heidelberg New York: Springer-Verlag, 1996.
51. L. Lamport. What good is temporal logic? In R. E. A. Mason, (ed.), Information Processing 83: Proceedings of the Ninth IFIP World Computer Congress, pp. 657-668. Elsevier Science Publishers, 1983.
52. L. Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3): 872-923, 1994.
53. N. A. Lynch, R. Segala, F. Vaandrager, H. B. Weinberg. Hybrid I/O Automata. In R. Alur, T. A. Henzinger, E. D. Sontag, (eds.), Hybrid Systems III, Lecture Notes in Computer Science 1066, pp. 496-510. Berlin Heidelberg New York: Springer-Verlag, 1996.
54. N. A. Lynch, F. Vaandrager. Action transducers and timed automata. In R. J. Cleaveland, (ed.), CONCUR 92: Theories of Concurrency, Lecture Notes in Computer Science 630, pp. 436-455. Berlin Heidelberg New York: Springer-Verlag, 1992.
55. K. L. McMillan. Symbolic Model Checking: An Approach to the State-explosion Problem. Kluwer Academic Publishers, 1993.
56. Z. Manna, Y. Kesten, A. Pnueli. Verifying clocked transition systems. In R. Alur, T. A. Henzinger, E. D. Sontag, (eds.), Hybrid Systems III, Lecture Notes in Computer Science 1066, pp. 13-40. Berlin Heidelberg New York: Springer-Verlag, 1996.
57. O. Maler, Z. Manna, A. Pnueli. From timed to hybrid systems. In J. W. de Bakker, K. Huizing, W.-P. de Roever, G. Rozenberg, (eds.), Real Time: Theory in Practice, Lecture Notes in Computer Science 600, pp. 447-484. Berlin Heidelberg New York: Springer-Verlag, 1992.
58. Z. Manna, A. Pnueli. Adequate proof principles for invariance and liveness properties of concurrent programs. Science of Computer Programming, 4(3): 257-289, 1984.
59. Z. Manna, A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Berlin Heidelberg New York: Springer-Verlag, 1992.
60. Z. Manna, A. Pnueli. Temporal Verification of Reactive Systems: Safety. Berlin Heidelberg New York: Springer-Verlag, 1995.
61. X. Nicollin, J. Sifakis. An overview and synthesis of timed process algebras. In K. G. Larsen, A. Skou, (eds.), CAV 91: Computer-aided Verification, Lecture Notes in Computer Science 575, pp. 376-398. Berlin Heidelberg New York: Springer-Verlag, 1991.
62. X. Nicollin, J. Sifakis, S. Yovine. From Atp to timed graphs and hybrid systems. Acta Informatica, 30: 181-202, 1993.
63. J.-F. Raskin, P.-Y. Schobbens. State clock logic: a decidable real-time logic. In O. Maler, (ed.), HART 97: Hybrid and Realtime Systems, Lecture Notes in Computer Science 1201, pp. 33-47. Berlin Heidelberg New York: Springer-Verlag, 1997.
64. F. B. Schneider. Understanding protocols for byzantine clock synchronization. Technical Report CSD-TR-87-859, Cornell University, 1987.