Decidability of a Hybrid Duration Calculus

Electronic Notes in Theoretical Computer Science

Volumn 174, Issue 6, 2007, Pages 113-133

  Bolander, Thomas ^a   Hansen, Jens Ulrik ^b   Hansen, Michael R ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

decision methods; Duration calculus; hybrid logic; monadic second order theory of order

Indexed keywords

COMPUTABILITY AND DECIDABILITY; DECISION THEORY; GLOBAL OPTIMIZATION; TECHNICAL PRESENTATIONS;

DECISION METHODS; DURATION CALCULUS; HYBRID LOGIC; MONADIC SECOND ORDER THEORY OF ORDER;

COMPUTATIONAL METHODS;

EID: 34249752075     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.11.029     Document Type: Article

References (28)

1. Allen J.F. Towards a general theory of action and time. Artifical Intelligence 23 (1984) 123-154
2. Blackburn P., de Rijke M., and Venema Y. Modal Logic. Cambridge Tracts in Theoretical Computer Science 53 (2001), Cambridge University Press
3. Bolander, T. and T. Braüner, Two tableau-based decision procedures for hybrid logic, in: H. Schlingloff, editor, Proceedings of the 4th Methods for Modalities (M4M) workshop (2005), pp. 79-96
4. Bresolin D., and Montanari A. A tableau-based decision procedure for right propositional neighbourhood logic. TABLEAUX 2005. LNAI 3702 (2005) 63-77
5. Buchi J. Weak second-order arithmetic and finite automata. Z. Math. Logik Grundl. Math 6 (1960) 66-92
6. Chetcuti-Sperandio N. Tableau-based automated deduction for duration calculus. TABLEAUX 2002. Lecture Notes in Computer Science 2381 (2002) 53-69
7. Chetcuti-Sperandio N., and del Cerro L.F. A decision method for duration calculus. Journal of Universal Computer Science 5 (1999) 743-764
8. Chetcuti-Sperandio N., and del Cerro L.F. A mixed decision method for duration calculus. Journal of Logic and Computation 10 (2000) 877-895
9. Elgot C. Decision problems of finite automata design and related arithmetics. Transactions of the American Mathematical Society 98 (1961) 21-52
10. Fitting M. Proof methods for modal and intuitionistic logics. Synthese Library 169 (1983), D. Reidel Publishing Co., Dordrecht viii+555 pp
11. Fränzle, M., "Controller Design from Temporal Logic: Undecidability Need Not Matter," Ph.D. thesis, Institut für Informatik und Praktische Mathematik der Christian-Albrechts-Universität Kiel. (1997)
12. Fränzle M. Take it np-easy: Bounded model construction for duration calculus. In: Damm W., and Olderog E.-R. (Eds). Formal Techniques in Real-Time and Fault-Tolerant Systems. Lecture Notes in Computer Science 2469 (2002) 245-264
13. Fränzle M. Model-checking dense-time duration calculus. Formal Aspects of Computing 16 (2004) 121-139
14. Goranko V., Montanari A., and Sciavicco G. A road map of interval temporal logics and duration calculi. Journal of Applied Non-Classical Logics 14 (2004) 9-54
15. Halpern J., Moskowski B., and Manna Z. A hardware semantics based on temporal intervals. ICALP'83. Lecture Notes in Computer Science 154 (1983) 278-291
16. Halpern J.Y., and S.Y. A propositional modal logic of time intervals. Journal of the ACM 33 (1991) 935-962
17. Hansen M.R., and Chaochen Z. Duration calculus: Logical foundations. Formal Aspects of Computing 9 (1997) 283-330
18. Hughes G.E., and Cresswell M.J. A new introduction to modal logic (1996), Routledge, London x+421 pp
19. Klarlund, N. and A. Møller, Mona version 1.4: User manual, BRICS, Department of Computer Science, University of Aarhus, Denmark, URL: http://www.brics.dk/mona
20. Pandya, P.K., Specifying and deciding quantified discrete-time duration calculus formulae using DCVALID, Technical report TCS00-PKP-1, Tata Institute of Fundamental Research, India (2000)
21. Quesel J.-D., and Schäfer A. Spatio-temporal model checking for mobile real-time systems. ICTAC'06. Lecture Notes in Computer Science 4281 (2006) 347-361
22. Rabinovich A.M. Non-elementary lower bound for propositional duration calculus. Information Processing Letters 66 (1998) 7-11. URL citeseer.ist.psu.edu/4239.html
23. Rabinovich A.M. On the decidability of continuous time specification formalisms. Journal of Logic and Computation 8 (1998) 669-678. URL citeseer.ist.psu.edu/rabinovich98decidability.html
24. Ravn A., Rischel H., and Hansen K. Specifying and verifying requirements of real-time systems. IEEE Trans. Softw. Eng. 19 1 (1993) 41-55
25. Zhou C., and Hansen M.R. An adequate first order interval logic. Lecture Notes in Computer Science 1536 (1998) 584-608. URL citeseer.ist.psu.edu/article/chaochen96adequate.html
26. Zhou C., and Hansen M.R. Duration Calculus: A Formal Approach to Real-Time Systems. EATCS: Monographs in Theoretical Computer Science (2004), Springer 257
27. Zhou C., Hansen M.R., and Sestoft P. Decidability and undecidability results for duration calculus. In: Enjalbert P., Finkel A., and Wagner K.W. (Eds). STACS'93. Lecture Notes in Computer Science 665 (1993) 58-68
28. Zhou, C., C.A.R. Hoare and A.P. Ravn, A calculus of durations, Information Processing Letters 40 (91), pp. 269-276