Modeling time in computing: A taxonomy and a comparative survey

ACM Computing Surveys

Volumn 42, Issue 2, 2010, Pages

  Furia, Carlo A ^a,b   Mandrioli, Dino ^b   Morzenti, Angelo ^b   Rossi, Matteo ^b  

^a ETH ZURICH   (Switzerland)

^b POLITECNICO DI MILANO   (Italy)

Author keywords

Dynamic systems; Temporal aspects of computing; Time modeling

Indexed keywords

COMPUTER-BASED SYSTEM; COMPUTING TIME; DYNAMIC SYSTEMS; FORMAL MODELING; KEY DIMENSIONS; LEVEL OF DETAIL; PERVASIVE COMPUTING; REAL-TIME AND EMBEDDED SYSTEMS; SOCIAL SYSTEMS; TEMPORAL ASPECTS; TEMPORAL FEATURES; TIME MODELING;

COMPUTER CONTROL SYSTEMS; DYNAMIC PROGRAMMING; EMBEDDED SYSTEMS; HYBRID SYSTEMS; SURVEYS; TAXONOMIES;

REAL TIME SYSTEMS;

EID: 77949400735     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/1667062.1667063     Document Type: Article

References (161)

1. ABADI, M. AND LAMPORT, L. 1994. An old-fashioned recipe for real time. ACM Trans. Program. Lang. Syst. 16, 5, 1543-1571.
2. ALUR, R. AND MADHUSUDAN, P. 2004. Decision problems for timed automata: A survey. In Revised Lectures from the International School on Formal Methods for the Design of Computer, Communication and Software Systems: Formal Methods for the Design of Real-Time Systems (SFM-RT'04), M. Bernardo and F. Corradini Eds., Lecture Notes in Computer Science, vol.3185, Springer, Berlin, 1-24.
3. ALUR, R., FEDER, T., AND HENZINGER, T. A. 1996. The benefits of relaxing punctuality. J. A C M 4 3, 1, 116-146.
4. ALUR, R., COURCOUBETIS, C., HALBWACHS, N., HENZINGER, T. A., HO, P.-H., NICOLLIN, X.,OLIVERO, A., SIFAKIS, J., AND YOVINE, S. 1995. The algorithmic analysis of hybrid systems. Theor. Comput. Sci. 138, 3-34.
5. ALUR, R. ANDKURSHAN,R.P. 1995. Timing analysisinCOSPAN. In Proceedings of the 3rd DIMACS/SYCON Workshop on Verification and Control of Hybrid Systems. R. Alur et al. Eds., Lecture Notes in Computer Science, vol.1066, Springer, Berlin, 220-231.
6. ALUR, R. AND DILL, D. L. 1994. A theory of timed automata. Theor. Comput. Sci. 126, 2, 183-235.
7. ALUR, R. AND HENZINGER, T. A. 1994. A really temporal logic. J. ACM 4 1, 1, 181-204.
8. ALUR, R. AND HENZINGER, T. A. 1993. Real-time logics: Complexity and expressiveness. Inform. Comput. 104, 1, 35-77.
9. ALUR, R., COURCOUBETIS, C., AND DILL, D. L. 1993. Model-checking in dense real-time. Inform Comput. 104, 1, 2-34.
10. ALUR, R., COURCOUBETIS, C., HENZINGER, T. A., AND HO, P.-H. 1993. Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In Hybrid Systems, R. L. Grossman et al. Eds., Lecture Notes in Computer Science, vol.736, Springer, Berlin, 209-229.
11. ALUR, R. AND HENZINGER, T. A. 1992a. Back to the future: Towards a theory of timed regular languages. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (FOCS'92). IEEE, Los Alamitos, CA, 177-186.
12. ALUR, R. AND HENZINGER, T. A. 1992b. Logics and models of real time: A survey. In Real Time: Theory in Practice. Lecture Notes in Computer Science, vol.600, Springer, Berlin, 74-106
13. ANTSAKLIS, P. J. (ED.). 2000. Special issue on hybrid systems: Theory and applications. Proc. IEEE 88.
14. ARCHER, M. 2000. TAME: Using PVS strategies for special-purpose theorem proving. Ann. Math. Artif. Intell. 29, 1-4, 139-181.
15. ARCHER, M. AND HEITMEYER, C. L. 1996. Mechanical verification of timed automata: A case study. In Proceedings of the IEEE Real Time Technology and Applications Symposium. IEEE, Los Alamitos, CA, 192-203.
16. ASARIN, E. 2004. Challenges in timed languages: From applied theory to basic theory. Bull. EATCS 83, 106-120.
17. ASARIN, E., CASPI, P., AND MALER, O. 2002. Timed regular expressions. J. ACM 4 9, 2, 172-206.
18. BAETEN, J. C. M. 2003. Over thirty years of process algebra: Past, present and future. In Process Algebra: Open Problems and Future Directions, L. Aceto et al. Eds., BRICS Notes Series, vol.NS-03-3. 7-12.
19. BAETEN,J.C.M. 2004. Abrief historyofprocess algebra. Tech. rep. CSR 04-102, DepartmentofMathematics and Computer Science, Technische Universiteit Eindhoven.
20. BAETEN, J. C. M. AND MIDDELBURG, C. A. 2002. Process Algebra with Timing. Monographs in Theoretical Computer Science. Springer, Berlin.
21. BAETEN, J. C. M. AND WEIJLAND, W. P. 1990. Process Algebra. Cambridge Tracts in Theoretical Computer Science, Vol.18. Cambridge University Press.
22. BEKIC, H. 1984. Programming languages and their definition. In Selected Papers by Hans Bekific, C.B. Jones Ed., Lecture Notes in Computer Science, vol.177. Springer, Berlin.
23. BEKIC, H. 1971. Towards a mathematical theory of processes. Tech. rep. 25.125, IBM Laboratory, Vienna. Published in Bekic [1984].
24. BELLINI, P., MATTOLINI, R., AND NESI, P. 2000. Temporal logics for real-time system specification. ACM Comput. Surv. 32, 1, 12-42.
25. BENGTSSON, J. AND YI, W. 2004. Timed automata: Semantics, algorithms and tools. In Lectures on Concurrency and Petri Nets, Advances in Petri Nets (ACPN'03), J. Desel et al. Eds., Lecture Notes in Computer Science, vol.3098. Springer, Berlin, 87-124
26. BERGSTRA, J. A., PONSE, A., AND SMOLKA, S. A. (EDS.). 2001. Handbook of Process Algebra. Elsevier, Amsterdam.
27. BERRY, G. AND GONTHIER, G. 1992. The Esterel synchronous programming language: Design, semantics, implementation. Sci. Comput. Program. 19, 2, 87-152.
28. BERTHOMIEU, B. AND DIAZ, M. 1991. Modeling and verification of time dependent systems using time Petri nets. IEEE Trans. Softw. Eng. 17, 3, 259-273.
29. BIENMULLER, T., DAMM, W., AND WITTKE, H. 2000. The STATEMATE verification environment: Making it real. In Proceedings of the 12th International Conference on Computer Aided Verification (CAV'00). Lecture Notes in Computer Science, vol.1855. Springer, Berlin, 561-567.
30. BJORNER, N. S., BROWNE, A., COLÓN, M., FINKBEINER, B., MANNA, Z., SIPMA, H. B., AND URIBE, T. E. 2000. Verifying temporal properties of reactive systems: A STeP tutorial. Formal Method Syst, Des. 16, 3, 227-270.
31. BOOCH, G. AND BRYAN, D. 1994. Software Engineering with ADA. Addison-Wesley, Reading, MA.
32. BÖRGER, E. AND STÄRK, R. F. 2003. Abstract State Machines. A Method for High-Level System Design and Analysis. Springer, Berlin.
33. BOUYER, P., CHEVALIER, F., AND MARKEY, N. 2005. On the expressiveness of TPTL and MTL. In Proceedings of the 25th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'05), R. Ramanujam and S. Sen Eds., Lecture Notes in Computer Science, vol.3821, Springer, Berlin, 432-443.
34. BOZGA, M., GRAF, S., OBER, I., OBER, I., AND SIFAKIS, J. 2004. The IF toolset. In Revised Lectures from the International School on Formal Methods for the Design of Computer, Communication and Software Systems: Formal Methods for the Design of Real-Time Systems (SFM-RT'04), M. Bernardo and F. Corradini, (Eds.), Lecture Notes in Computer Sciences, Vol.3185. Springer, Berlin, 237-267.
35. BRAINERD, W. S. AND LANDWEBER, L. H. 1974. Theory of Computation. Wiley, New York.
36. BRANICKY, M. S., BORKAR, V. S., AND MITTER, S. K. 1998. A unified framework for hybrid control: Model and optimal control theory. IEEE Trans. Autom. Control 43, 1, 31-45
37. BRINKSMA, E. (ED.). 1989. Information processing systems. Open systems interconnection (LOTOS). A formal description technique based on the temporal ordering of observational behaviour. ISO. ISO 8807:1989.
38. BURNS, A.ANDBAXTER,G. 2006. Time bandsinsystems structure. InStructurefor Dependability,D.Besnard et al. Eds., Springer, Berlin.
39. CASSANDRAS, C. G. AND LAFORTUNE, S. 1999. Introduction to Discrete Event Systems. Kluwer Academic, Amsterdam.
40. CASSEZ, F., HENZINGER, T. A., AND RASKIN, J.-F. 2002. A comparison of control problems for timed and hybrid systems. In Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control (HSCC'02).C.Tomlin and M.R. Greenstreet Eds., Lecture NotesinComputer Science,vol.2289,Springer, Berlin, 134-148.
41. CERONE, A. 1993. A net-based approach for specifying real-time systems. PhD dissertation, Università degli Studi di Pisa, Dip. di Informatica. TD-16/93.
42. CERONE, A. AND MAGGIOLO-SCHETTINI, A. 1999. Time-based expressivity of time Petri nets for system specification. Theor. Comput. Sci. 216, 1-2, 1-53.
43. CHAOCHEN, Z., HOARE, C. A. R., AND RAVN, A. P. 1991. A calculus of duration. Inform. Process. Lett. 40, 5, 269-276.
44. CLARKE, E. M., GRUMBERG, O., AND PELED, D. A. 2000. Model Checking. MIT Press, Cambridge, MA.
45. COOK, M. 2004. Universality in elementary cellular automata. Complex Syst.15, 1-40.
46. CORSETTI, E., CRIVELLI, E., MANDRIOLI, D., MORZENTI, A., MONTANARI, A., SAN PIETRO, P., AND RATTO, E. 1991. Dealing with different time scales in formal specifications. In Proceedings of the 6th International Workshop on Software Specification and Design. 92-101.
47. D'ARGENIO, P. R. AND KATOEN, J.-P. 2005. A theory of stochastic systems (parts i and ii). Inform. Comput. 203, 1, 1-74.
48. DAVIES, J. AND SCHNEIDER, S. 1995. A brief history of timed CSP. Theor. Comput. Sci. 138, 243-271.
49. Emerson E.A., 1990, Temporal and modal logic, Handbook of Theoretical Computer Science
50. J. van B, Elsevier Science, Amsterdam, 996-1072
51. EMERSON, E. A. AND HALPERN, J. Y. 1986. Sometimes "and not never" revisited: On branching versus linear time temporal logic J. ACM 33; 1 151-178.
52. EMERSON, E. A. 1990. Temporal and modal logic. In Handbook of Theoretical Computer Science.
53. J. van Leeuwen Ed. ERIKSSON, H.-E., PENKER, M., LYONS, B., AND FADO D. 2003. UML 2 Toolkit. Wiley, New York. time temporal logic. J. ACM 33, 1, 151-178.
54. ERIKSSON, H.-E., PENKER, M., LYONS, B., AND FADO, D. 2003. UML 2 Toolkit. Wiley, New York.
55. FELDER, M., MANDRIOLI, D., AND MORZENTI, A. 1994. Proving properties of real-time systems through logical specifications and Petri net models. IEEE Trans. Softw. Eng. 20, 2, 127-141.
56. FLAKE, S. AND MUELLER, W. 2002. An OCL extension for real-time constraints. In Object Modeling with the OCL, T. Clark and J. Warmer Eds., Lecture Notes in Computer Science, vol.2263, Springer, Berlin, 150-171.
57. FRANCEZ, N. 1986. Fairness. Monographs in Computer Science. Springer, Berlin. FURIA, C. A.
58. PRADELLA, M., AND ROSSI, M. 2008a. Automated verification of dense-time MTL specifications via discrete-time approximation. In Proceedings of the 15th International Symposium on Formal Methods (FM'08), J. Cuellar et al. Eds., Lecture Notes in Computer Science, vol.5014. Springer, Berlin, 132-147.
59. FURIA, C. A., PRADELLA, M., AND ROSSI, M. 2008b. Comments on temporal logics for real-time system specification. ACM Comput. Surv.
60. FURIA, C. A. AND ROSSI, M. 2006. Integrating discrete-and continuous-time metric temporal logics through sampling. In Proceedings of the 4th International Conference on the Formal Modeling and Analysis of Timed Systems (FORMATS'06), E. Asarin and P. Bouyer Eds., Lecture Notes in Computer Science, Springer, Berlin.
61. GABBAY, D. M., PNUELI, A., SHELAH, S., AND STAVI, J. 1980. On the temporal basis of fairness. In Proceedings of the 7th Annual ACM Symposium on Principles of Programming Languages (POPL'80). ACM, New York, 163-173.
62. GABBAY, D. M. 1987. The declarative past and imperative future. In Proceedings of Temporal Logic in Specification (TLS'87), B. Banieqbal et al. Eds., Lecture Notes in Computer Science, vol.398, Springer, Berlin, 409-448.
63. GARGANTINI, A. AND MORZENTI, A. 2006. Automated verification of continuous time systems by discrete temporal induction. In Proceedings of the 13th International Symposium on Temporal Representation and Reasoning (TIME'06), IEEE, Los Alamitos CA.
64. GARGANTINI, A. AND MORZENTI, A. 2001. Automated deductive requirements analysis of critical systems. ACM Trans. Softw. Eng. Methodol. 10, 3, 255-307.
65. GARGANTINI, A., MANDRIOLI, D., AND MORZENTI,A. 1999. Dealing with zero-time transitionsinaxiom systems. Inform Comput. 150, 2, 119-131.
66. GHEZZI, C. AND MANDRIOLI, D. 2006. The challenges of software engineering education. In Proceedings of the ICSE 2005 Education Track. P. Inverardi and M. Jazayeri Eds., Lecture Notes in Computer Science, vol.4309. Springer, Berlin, 115-127.
67. GHEZZI, C., JAZAYERI, M., AND MANDRIOLI, D. 2002. Fundamentals of Software Engineering 2nd ed. Prentice Hall, Englewood Cliffs, NJ.
68. GHEZZI, C., MANDRIOLI, D., MORASCA, S., AND PEZZE, M. 1991. A unified high-level Petri net formalism for time-critical systems. IEEE Trans. Softw. Eng. 17, 2, 160-172.
69. GHEZZI, C., MANDRIOLI, D., AND MORZENTI, A. 1990. TRIO: A logic language for executable specifications of real-time systems. J. Syst. Softw.12, 2, 107-123.
70. GIESE, H., TICHY, M., BURMESTER, S., AND FLAKE, S. 2003. Towards the compositional verification of real-time UML designs. In Proceedings of ESEC/SIGSOFT FSE. 38-47.
71. HAREL, D. AND NAAMAD, A. 1996. The STATEMATE semantics of statecharts. ACM Trans. Softw. Eng. Methodol. 5, 4, 293-333.
72. HAREL, D., LACHOVER, H., NAAMAD, A., PNUELI, A., POLITI, M., SHERMAN, R., SHTULL-TRAURING, A., AND TRAKHT-ENBROT, M. B. 1990. STATEMATE: A working environment for the development of complex reactive systems. IEEE Trans. Softw. Eng. 16, 4, 403-414.
73. HAREL,D. 1987. Statecharts:Avisual formalism for complex systems.Sci. Comput. Program. 8,3,231-274.
74. HAREL, D., PNUELI, A., SCHMIDT, J. P., AND SHERMAN, R. 1987. On the formal semantics of statecharts. In Proceedings of the 2nd IEEE Symposium on Logic in Computer Science (LICS'87). 54-64.
75. HEITMEYER, C. L. AND MANDRIOLI, D. (EDS.). 1996. Formal Methods for Real-Time Computing. Wiley, New York.
76. HENZINGER, T. A. 1998. It's about time: Real-time logics reviewed. In Proceedings of the 9th International Conference on Concurrency Theory (CONCUR'98), D. Sangiorgi and R. de Simone Eds., Lecture Notes in Computer Science, vol.1466. Springer, Berlin, 439-454.
77. Henzinger T.A. Kopke P.W. Puri A. Varaiya P., What's decidable about hybrid automata?, J. Comput. Syst. Sci., 57, 1, 94-124
78. HENZINGER, T. A., KOPKE, P. W., PURI, A., AND VARAIYA, P. 1998. What's decidable about hybrid automata?
79. HENZINGER, T. A., HO, P.-H., AND WONG-TOI, H. 1997. HYTECH: A model checker for hybrid systems. Int. J Comput. Syst. Sci. 57, 1, 94-124.
80. HENZINGER, T. A., HO, P.-H., AND WONG-TOI, H. 1997. HYTECH: A model checker for hybrid systems. Int. J. Softw. Tools Technol. Transfer 1, 1-2.
81. HENZINGER, T. A. 1996. The theory of hybrid automata. In Proceedings of the 11th Annual Symposium on Logic in Computer Science (LICS). IEEE Los Alamitos CA. 278-292.
82. HENZINGER, T. A., NICOLLIN, X., SIFAKIS, J., AND YOVINE, S. 1994. Symbolic model checking for real-time systems. Inform. Comput. 111, 2, 193-244.
83. HIRSHFELD, Y. AND RABINOVICH, A. 2004. Logics for real time: Decidability and complexity. Fundamenta Inform. 62, 1, 1-28.
84. HOARE, C. A. R. 1985. Communicating Sequential Processes. Prentice Hall, Englewood Cliffs, NJ.
85. HOARE, C. A. R. 1978. Communicating sequential processes. Comm. ACM 21, 8, 666-677.
86. HOLZMANN, G. J. 2003. The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley, Reading, MA.
87. HOPCROFT, J. E., MOTWANI, R., AND ULLMAN, J. D. 2000. Introduction to Automata Theory, Languages, and Computation 2nd ed. Addison-Wesley, Reading, MA.
88. JAHANIAN, F. AND MOK, A. K. 1986. Safety analysis of timing properties in real-time systems. IEEE Trans. Softw. Eng. 12, 9, 890-904.
89. JAHANIAN, F. AND MOK, A. K. 1994. Modechart: A specification language for real-time systems. IEEE Trans. Softw. Eng. 20, 12, 933-947.
90. KAMP, J. A. W. 1968. Tense logic and the theory of linear order. PhD dissertation, University of California, Los Angeles.
91. KATZ, R. H. AND BORRIELLO, G. 2004. Contemporary Logic Design 2nd Ed. Prentice-Hall, Englewood Cliffs, NJ.
92. KESTEN, Y. AND PNUELI, A. 1992. Timed and hybrid statecharts and their textual representation. In Proceedings of the 2nd International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT'92). J. Vytopil Ed., Lecture Notes in Computer Science, vol.571, Springer, Berlin, 591-620.
93. KHALIL, H. 1995. Nonlinear Systems 2nd ed. Prentice-Hall, Englewood Cliffs, NJ.
94. KNOPP, K. 1996. Theory of Functions. Parts 1 and 2 (in one volume). Dover, Ch. 8, 83-111.
95. KOYMANS, R. 1992. (Real) time: A philosophical perspective. In Proceedings of the REX Workshop: RealTime: Theory in Practice. J. W. de Bakkeret al. Eds., Lecture Notes in Computer Science, vol.600, Springer, Berlin, 353-370.
96. KOYMANS, R. 1990. Specifying real-time properties with metric temporal logic. Real-Time Syst. 2, 4, 255-299.
97. KRIPKE, S. A. 1963. Semantical analysis of modal logic I. Zeitschrift Math. Logik Grundlagen Math. 9, 67-96.
98. LAMPORT, L. 1994. The temporal logic of actions. ACM Trans. Program. Lang. Syst. 16, 3, 872-923.
99. LAMPORT, L. 1983. What good is temporal logic? In Proceedings of the 9th IFIP World Congress, R E.A. Mason Ed., Information Processing, vol.83. North-Holland, Amsterdam, 657-668.
100. LAMPORT, L. 1980. Sometime is sometimes not never: On the temporal logic of programs. In Proceedings of the 7th ACM Symposium on Principles of Programming Languages (SIGPLAN-SIGACT). ACM, New York, 174-185.
101. LAROUSSINIE, F., MARKEY, N., AND SCHNOEBELEN, P. 2002. Temporal logic with forgettable past. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02). IEEE, Los Alomitos, CA, 383-392.
102. LARSEN, K. G., PETTERSSON, P., AND YI, W. 1997. UPPAAL in a nutshell. Int. J. Softw. Tools Technol.Transfer 1, 1-2.
103. LICHTENSTEIN, O., PNUELI, A., AND ZUCK, L. D. 1985. The glory of the past. In Proceedings of 3rd Workshop on Logic of Programs. Lecture Notes in Computer Science, vol.193. Springer, 196-218.
104. LUTZ, C., WALTHER, D., AND WOLTER, F. 2007. Quantitative temporal logics over the reals: PSPACE and below. Inform. Comput. 205, 1, 99-123.
105. LYNCH, N. AND VAANDRAGER, F. W. 1996. Forward and backward simulations: Part II: Timing-based systems. Inform. Comput. 128, 1, 1-25.
106. MAGEE, J. AND KRAMER, J. 1999. Concurrency: State Models & Java Programs. Wiley, New York.
107. MANDRIOLI, D. AND GHEZZI, C. 1987. Theoretical Foundations of Computer Sciences. Wiley, New York.
108. MANNA, Z. AND PNUELI, A. 1992. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, Berlin.
109. MEALY, G. H. 1955. A method for synthesizing sequential circuits. Bell Syst. Tech. J. 34, 1045-1079.
110. MENDELSON, E. 1997. Introduction to Mathematical Logic 4th Ed. Chapman and Hall.
111. MERLIN, P. M. AND FARBER, D. J. 1976. Recoverability and communication protocols: Implications of a theoretical study. IEEE Trans. Comm. 24, 9, 1036-1043.
112. MILNER, R. 1980. A Calculus of Communicating Systems. Lecture Notes in Computer Science, vol.92, Springer, Berlin.
113. MILNER, R. 1989. Communication and Concurrency. Prentice-Hall, Englewood Cliffs, NJ.
114. MOORE, E. F. 1956. Gedanken experiments on sequential machines. In Automata Studies. Annals of Mathematical Studies, vol.34, Princeton University Press, Princeton, NJ, 129-153.
115. MORZENTI, A., MANDRIOLI, D., AND GHEZZI,C. 1992. Amodel parametric real-time logic. ACM Trans. Program. Lang. Syst. 14, 4, 521-573.
116. MOSZKOWSKI, B. 1986. Executing Temporal Logic Programs. Cambridge University Press.
117. MOSZKOWSKI, B. 1983. Reasoning about digital circuits. PhD dissertation, Tech. rep. STAN-CS-83-970, Department of Computer Science, Stanford University.
118. NICOLLIN, X., OLIVERO, A., SIFAKIS, J., AND YOVINE, S. 1993. Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In Hybrid Systems, R.L. Grossman et al. Eds., Lecture Notes in Computer Science, vol.736. Springer, Berlin, 149-178.
119. NICOLLIN, X. AND SIFAKIS, J. 1991. An overview and synthesis of timed process algebras. In Proceedings of the 3rd International Workshop on Computer Aided Verification (CAV'91), K. G. Larsen and A. Skou (Eds.), Lecture Notes in Computer Sciences, Vol.575. Springer, Berlin, 376-398.
120. ODIFREDDI, P. 1999. Classical Recursion Theory. North Holland, Amsterdam.
121. OSTROFF, J. S. 1999. Composition and refinement of discrete real-time systems. ACM Trans. Softw. Eng. Methodol. 8, 1, 1-48.
122. OSTROFF, J. S. 1997. A visual toolset for the design of real-time discrete-event systems. IEEE Trans. Control Syst. Technol. 5, 3, 320-337.
123. OSTROFF, J. S. 1992. Formal methods for the specification and design of real-time safety critical systems. J. Syst. Softw. 18, 1, 33-60.
124. OSTROFF, J. S. 1990. Deciding properties of timed transition models. IEEE Trans. Parallel Distrib. Syst. 1, 2, 170-183.
125. OSTROFF, J. S. 1989. Temporal Logic for Real Time Systems. Wiley, New York.
126. OUIMET, M. AND LUNDQVIST, K. 2007a. The TASM toolset: Specification, simulation, and formal verification of real-time systems. In Proceedings of the 19th International Conference on Computer-Aided Verification (CAV'07), W. Damm and H. Hermanns Eds., Lecture Notes in Computer Science, vol.4590. Springer, Berlin,126-130.
127. OUIMET, M. AND LUNDQVIST, K. 2007b. The timed abstract state machine language: Abstract state machines for real-time system engineering. In Proceedings of the 14th International Workshop on Abstract State Machines (ASM'07).
128. PAPADIMITRIOU, C. H. 1994. Computational Complexity. Addison-Wesley, Reading, MA.
129. PERON,A. 1993. Synchronous and asynchronous models for statecharts. Tech. rep. TD-21/93, Dipartimento di Informatica, Universita di Pisa.
130. PERRIN, D. AND PIN, J.-E. 2004. Infinite Words. Pure and Applied Mathematics, vol.141. Elsevier, Amsterdam.
131. PETERSON, J. L. 1981. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Englewood Cliffs, NJ.
132. PETRI, C.A. 1963. Fundamentalsofatheoryof asynchronous information. InProceedings of IFIP Congress. North Holland, Amsterdam, 386-390.
133. PNUELI, A. AND SHALEV, M. 1991. What is in a step: On the semantics of statecharts. In Proceedings of the International Conference on Theoretical Aspects of Computer Software (TACS'91), T. Ito and A.R. Meyer Eds., Lecture Notes in Computer Science, vol.526, Springer, Berlin, 244-264.
134. PNUELI, A. 1977. The temporal logic of programs. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science (FOCS'77). 46-67
135. REED,G.M.AND ROSCOE,A.W. 1988. Atimedmodelforcommunicating sequentialprocesses.Theor. Comput. Sci. 58, 1-3, 249-261.
136. REISIG, W. 1985. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer, Berlin.
137. RESCHER, N. AND URQUHART, A. 1971. Temporal Logic. Springer, Berlin.
138. ROGERS, H., JR. 1987. Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge, MA.
139. ROMAN, G.-C. 1990. Formal specification of geographic data processing requirements. IEEE Trans. Knowledge Data Eng. 2, 4, 370-380.
140. ROSCOE, A. W. 1997. The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs, NJ.
141. RUTTEN, J., KWIATKOWSKA, M., NORMAN, G., AND PARKER, D. 2004. Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems. American Mathematical Society.
142. SCHNEIDER, S. 2000. Concurrent and Real-Time Systems: The CSP Approach. Wiley, New York.
143. SCHNOEBELEN, P. 2002. The complexity of temporal logic model checking. In Proceedings of the 4th Conference on Advances in Modal Logic. P. Balbiani et al. Eds., King's College Publications, 393-436.
144. SCHWARTZ, R. L., MELLIAR-SMITH, P. M., AND VOGT, F. H. 1983. An interval logic for higher-level temporal reasoning. In Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing (PODC'83). ACM, New York, 198-212.
145. SIPSER, M. 2005. Introduction to the Theory of Computation 2nd Ed. Course Technology.
146. SKOGESTAD, S. AND POSTLETHWAITE, I. 2005. Multivariable Feedback Control: Analysis and Design 2nd Ed. Wiley, New York.
147. SOMMERVILLE, I. 2004. Software Engineering 7th Ed. Addison Wesley, Reading, MA
148. TGI. Petri nets tools database. http://www.informatik.unihamburg.de/TGI/ PetriNets/tools/quick.html.
149. THOMAS, W. 1990. Automata on infinite objects. In Handbook of Theoretical Computer Science, vol.B, J. van Leeuwen Ed., Elsevier, Amsterdam, 133-164
150. UML05. 2005. UML 2.0 superstructure specification. Tech. rep. formal/05-07-104, Object Management Group
151. UML04. 2004. Unified modeling language specification. Tech. rep. formal/04-07-102, Object Management Group.
152. VAN DER SCHAFT, A. AND SCHUMACHER, H. 2000. An Introduction to Hybrid Dynamical Systems. Lecture Notes in Computer Science, vol.251, Springer, Berlin
153. VAN EIJK, P. H. J., VISSERS, C. A., AND DIAZ, M. (EDS.). 1989. The Formal Description Technique LOTOS. Elsevier Science, Amsterdam.
154. VARDI, M. Y. 1996. An automata-theoretic approach to linear temporal logic. In Proceedings of the 8th BANFF Higher Order Workshop Conference on Logics for Concurrency: Structure versus Automata. Lecture Notes in Computer Science, vol.1043, Springer, Berlin, 238-266.
155. VARDI, M. Y. 2001. Branching vs. linear time: Final showdown. InProceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'01), T. Margaria and W. Yi Eds., Lecture Notes in Computer Science, vol.2031, Springer, Berlin, 1-22.
156. VON DER BEECK, M. 1994. A comparison of statecharts variants. In Proceedings of the 3rd International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems. Lecture Notes in Computer Science, vol.863. Springer, Berlin, 128-148
157. WARMER, J. B. AND KLEPPE, A. G. (EDS.). 1999. The Object Constraint Language. Addison-Wesley, Reading, MA.
158. WEISSTEIN, E. W. Real analytic function. MathWorld. http://mathworld. wolfram.com/RealAnalyticFunction.html.
159. WIRTH, N. 1977. Toward a discipline of real-time programming. Commun. ACM 20, 8, 577-583.
160. WOLFRAM, S. 1994. Cellular Automata and Complexity. Perseus Books Group.
161. YOVINE, S. 1997. Kronos: A verification tool for real-time systems. Int. J. Softw. Tools Technol. Transfer 1, 1-2.