A first order logic for specification of timed algorithms: Basic properties and a decidable class

Annals of Pure and Applied Logic

Volumn 113, Issue 1-3, 2001, Pages 13-52

  Beauquier, Danièle ^a   Slissenko, Anatol ^a  

^a UNIVERSITÉ PARIS EST CRÉTEIL   (France)

Author keywords

Decidability; First order logic; Specification; Timed algorithms

Indexed keywords

EID: 0035960950     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(01)00049-5     Document Type: Article

References (38)

1. Alur R., Courcoubetis C., Halbwachs N., Henzinger T., Ho P.-H., Nicollin X., Olivero A., Sifakis J., Yovine S. The algorithmic analysis of hybrid systems. Theoret. Comput. Sci. 138:1995;3-34.
2. Alur R., Courcoubetis C., Henzinger T., Ho P.-H. Hybrid automata. an algorithmic approach to the specification and verification of hybrid systems Grossman R.L., Nerode A., Ravn A.P., Rischel H. Workshop on Theory of Hybrid Systems, 1992, Lecture Notes in Computer Science. vol. 736:1993;209-229 Springer, Berlin.
3. Alur R., Dill D. A theory of timed automata. Theoret. Comput. Sci. 126:1994;183-235.
4. D. Beauquier, A. Slissenko, On semantics of algorithms with continuous time, Technical Report 97-15, Revised version, Department of Informatics, 1997, University Paris 12, Available at http://www.eecs.umich.edu/gasm/ and at http://www.univ-paris12.fr/lacl/.
5. Beauquier D., Slissenko A. The railroad crossing problem. towards semantics of timed algorithms and their model-checking in high-level languages Bidoit M., Dauchet M. TAPSOFT'97: Theory and Practice of Software Development, Lecture Notes in Computer Science. vol. 1214:1997;201-212 Springer, Berlin.
6. D. Beauquier, A. Slissenko, Decidable verification for reducible timed automata specified in a first order logic with time, Technical Report 98-16, Department of Informatics, University Paris 12, 1998, Available at http://www.univ-paris12.fr/lacl/, submitted for publication.
7. D. Beauquier, A. Slissenko, Decidable classes of the verification problem in a timed predicate logic, Proc. 12th Internat. Symp. on Fundamentals of Computation Theory (FCT'99), Iaşi, Rumania, August 30-September 3, Lecture Notes in Computer Science, vol. 1684, Springer, Berlin, 1999, pp. 100-111.
8. Chaochen Z., Hoare C.A.R., Ravn A. A calculus of duration. Inform. Process. Lett. 40(5):1991;269-279.
9. Emerson A. Temporal and modal logic. van Leeuwen J. Handbook of Theoretical Computer Science, vol. B: Formal Models and Sematics. 1990;995-1072 Elsevier Science, Amsterdam.
10. Emerson A. Automated temporal reasoning about reactive systems. Moller F., Birtwistle G. Logic for Concurrency, Structure versus Automata. 1996;41-101 Springer, Berlin. (Series: Lecture notes in Computer Science (Tutorial), vol. 1043.).
11. Y. Gurevich, J. Huggins, The railroad crossing problem: an experiment with instantaneous actions and immediate reactions, in: H.K. Buening (Ed.), Computer Science Logics, Selected papers from CSL'95, Lecture Notes in Computer Science, vol. 1092, Springer, Berlin, pp. 266-290.
12. Gurevich Y. Evolving algebra 1993: Lipari guide. Börger E. Specification and Validation Methods. 1995;9-93 Oxford University Press, Oxford.
13. H.A. Hansson, Time and Probability in Formal Design of Distributed Systems, Elsevier, Amsterdam, 1994. (In: H. Zedan (Series Editor), Series: Real Time Safety Critical System, vol. 1.).
14. T. Henzinger, It's about time: real-time logics reviewed, Proc. 10th CONCUR, Lecture Notes in Computer Science, vol. 1466, Springer, Berlin, 1998, pp. 439-454.
15. Heitmeyer C., Lynch N. The generalized railroad crossing: a case study in formal verification of real-time systems, Proc. Real-Time Systems Symp., San Juan, Puerto Rico. 1994;IEEE Press, New York.
16. Heitmeyer C., Lynch N. Formal verification of real-time systems using timed automata. Heitmeyer C., Mandrioli D. Formal Methods for Real-Time Computing. 1996;83-106 Wiley, New York. (In: B. Krishnamurthy (Series Editor), Series: Trends in Software, vol. 5.).
17. C. Heitmeyer, D. Mandrioli (Eds.), Formal Methods for Real-Time Computing, Wiley, New York, 1996. (In: B. Krishnamurthy (Series Editor), Series: Trends in Software, vol. 5.).
18. Hirshfeld Y., Rabinovich A. A framework for decidable metrical logics, Proc. Internat. Conf. on Automata, Logic and Programming (ICALP'99), Lecture Notes in Computer Science. vol. 1644:1999;422-432 Springer, Berlin.
19. Lamport L. A new solution of Dijkstra's concurrent programming problem. Comm. ACM. 17(8):1974;453-455.
20. N. Lynch, R. Segala, F. Vaandrager, H. Weinberg, Hybrid i/o aotomata, Proc. DIMACS/SYCON Workshop on Verification and Control of Hybrid Systems (Hybrid Systems III: Verification and Control), New Brunswick, NJ, October 1995, Lecture Notes in Computer Science, vol. 1066, Springer, Berlin, 1996, pp. 496-510.
21. Milner R. Operational and algebraic semantics of concurrent processes. van Leeuwen J. Handbook of Theoretical Computer Science. Vol. B: Formal Models and Sematics. 1990;1201-1242 Elsevier Science, Amsterdam.
22. Manna Z., Pnueli A. Temporal Logic of Reactive and Concurrent Systems: Specification. 1992;Springer, Berlin.
23. Owre S., Rushby J., Shankar N., von Henke F. Formal verification for fault-tolerant architectures. Prolegomena to the design of PVS IEEE Trans. Software Eng. 21(2):1995;107-125.
24. Pnueli A. The temporal logic of programs, Proc. IEEE 18th Annu. Symp. on Foundations in Computer Science. 1977;46-57 IEEE. Press, New York.
25. PVS, WWW site of PVS papers. http://www.csl.sri.com/sri-csl-fm.html.
26. A. Rabinovich, Decidability in monadic logic of order over finitely variable signals. Manuscript, 1997, 15pp.
27. A. Rabinovich, Automata over continuous time, Manuscript, 1998, 32pp.
28. Rabinovich A. Expressive completeness of duration calculus. J. Inform. and Comput. 156:2000;320-344.
29. Rabinovich A. On the decidability of continuous time specification formalisms. J. Logic Comput. 8(5):1998;669-678.
30. A. Rabinovich, Composition theorems for generalized sums, Manuscript, 1999, 20pp.
31. Slissenko A. On measures of information quality of knowledge processing systems. Inform. Sci. 57-58:1991;389-402.
32. A. Slissenko, Minimizing entropy of knowledge representaion, Proc. 2nd Internat. Conf. on Computer Science and Information Technologies, August 17-22, 1999, Yerevan, Armenia, National Academy of Sciences of Armenia, 1999, pp. 2-6.
33. Sommerville I. Software Engineering. 4th ed. 1992;Addison-Wesley, Reading, MA.
34. V.V. Tarasov, Inference search control in expert systems based on explicit meta-rules of inference search, Ph.D. Thesis, St. Petersburg Institute for Informatics and automation, Russian Academy of Sciences, 1996 (in Russian).
35. B. Trakhtenbrot, Automata and hybrid systems, in: F. Moller, B. Trakhtenbrot (Eds.), Lecture Notes 153, Computing Science Department, Uppsala University, 1998.
36. M. Vardi, An automata-theoretic approach to linear temporal logic, in: F. Moller, G. Birtwistle (Eds.), Logic for Concurrency. Structure versus Automata, pp. 238-266. Springer-Verlag, 1996. Series: "Lecture notes in Computer Science (Tutorial)", vol. 1043.
37. M. Vardi, An automata-theoretic approach to linear temporal logic, in: F. Moller, G. Birtwistle (Eds.), Logic for Concurrency. Structure versus Automata, pp. 238-266. Springer-Verlag, 1996. Series: "Lecture notes in Computer Science (Tutorial)", vol. 1043.
38. V. Weispfenning, Mixed real-integer linear quantifier elimination, Proc. 1999 Internat. Symp. on Symbolic and Algebraic Computations (ISSAC'99), July 29-31, 1999, Vancouver, BC, Canada, ACM Press, New York, 1999, pp. 129-136.