Decidable classes of the verification problem in a timed predicate logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1684, Issue , 1999, Pages 100-111

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

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTER CIRCUITS; INTERACTIVE COMPUTER SYSTEMS; RATIONAL FUNCTIONS; TIME SHARING SYSTEMS;

NON NEGATIVES; PRACTICAL SYSTEMS; PREDICATE LOGIC; RATIONAL NUMBERS; SCALAR MULTIPLICATION; TYPICAL PROPERTIES; UNARY FUNCTIONS; VERIFICATION PROBLEMS;

REAL TIME SYSTEMS;

EID: 84956868022     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48321-7_7     Document Type: Conference Paper

References (17)

1. R. Alur, C. Courcoubetis, T. Henzinger, and P.-H. Ho. Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems. In R.L. Grossman, A. Nerode, A.P. Ravn, and H. Rischel, editors, Workshop on Theory of Hybrid Systems, 1992, pages 209–229. Springer Verlag, 1993. Lect. Notes in Comput. Sci, vol. 736.
2. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.
3. D. Beauquier and A. Slissenko. On semantics of algorithms with continuous time. Technical Report 97–15, Revised version., University Paris 12, Department of Informatics, 1997. Available at http://www.eecs.umich.edu/gasm/ and at http://www.univ-paris12.fr/lacl/.
4. D. Beauquier and A. Slissenko. The railroad crossing problem: Towards semantics of timed algorithms and their model-checking in high-level languages. In M. Bidoit and M. Dauchet, editors, TAPSOFT’97: Theory and Practice of Software Development, pages 201–212. Springer Verlag, 1997. Lect. Notes in Comput. Sci., vol. 1214.
5. D. Beauquier and A. Slissenko. Decidable verification for reducible timed automata specified in a first order logic with time. Technical Report 98–16, University Paris 12, Department of Informatics, 1998. Available at http://www.univparis12.fr/lacl/.
6. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Vol. B: Formal Models and Sematics, pages 995–1072. Elsevier Science Publishers B.V., 1990
7. Y. Gurevich. Evolving algebra 1993: Lipari guide. In E. Börger, editor, Specification and Validation Methods, pages 9–93. Oxford University Press, 1995
8. H. A. Hansson. Time and Probability in Formal Design of Distributed Systems. Elsevier, 1994. Series: “Real Time Safety Critical System”, vol. 1. Series Editor: H. Zedan.
9. T. Henzinger. It’s about time: real-time logics reviewed. In Proc. 10th CONCUR, pages 439–454. Springer-Verlag, 1998. Lect. Notes in Comput. Sci., vol. 1466.
10. Y. Hirshfeld and A. Rabinovich. Quantitative temporal logic. Manuscript, 11 p., 1998
11. Y. Hirshfeld and A. Rabinovich. A framework for decidable metrical logics. Manuscript, 13 p., 1999.
12. PVS. WWW site of PVS papers. http://www.csl.sri.com/sri-csl-fm.html.
13. A. Rabinovich. Decidability in monadic logic of order over finitely variable signals. Manuscript, 15 p., 1997.
14. A. Rabinovich. On the decidability of continuous time specification formalisms. Manuscript, 15 p., 1997. To appear in J. of Logic and Comput
15. A. Rabinovich. Expressive completeness of duration calculus. Manuscript, 33 p., 1998.
16. B. Trakhtenbrot. Automata and hybrid systems. Lecture Notes 153, Uppsala University, Computing Science Department, 1998. Edited by F. Moller and B. Trakhtenbrot
17. V. Weispfenning. Mixed real-integer linear quantifier elimination. In Proc. Of the 1999 Int. Symp. on Symbolic and Algebraic Computations (ISSAC’99), ACM Press, 1999. To appear.