Non-elementary lower bound for Propositional Duration Calculus

Information Processing Letters

Volumn 66, Issue 1, 1998, Pages 7-11

  Rabinovich, A ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Complexity; Duration Calculus; Propositional Duration Calculus; Real time systems; Star free expressions

Indexed keywords

EID: 0013316259     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00027-1     Document Type: Article

References (14)

1. K. Compton, C.W. Henson, A uniform method for proving lower bounds on the computational complexity of logical theories, Ann. Pure Appl. Logic 48 (1990) 1-79.
2. M. Fürer, Nicht-elementare untere Schranken in der Automaten-theorie, Doctoral Thesis, ETH, Zurich, 1978.
3. J. Halperin, B. Moszkowski, Z. Manna, A propositional modal logic of time intervals, in: Proc. Logic in Comput. Sci., 1986, pp. 279-292.
4. L. Lamport, The temporal logic of actions, ACM Trans. Programm. Languages Systems 16 (3) (1994) 872-923.
5. R. McNaughton, S. Papert, Counter-free Automata, MIT Press, Cambridge, MA, 1971.
6. A. Rabinovich, On expressive completeness of Duration and Mean Value Calculi, in: Proceedings of EXPRESS, Electronic Notes in Theoret. Comput. Sci., Vol. 7, 1997.
7. A. Ravn, H. Richel, K. Hansen, Specifying and verifying requirement of real time systems, IEEE Trans. Software Engrg., 1993.
8. P. Sestoft, Personal communication.
9. J. Skakkebak, A. Ravn, H. Richel, Zhou Chaochen, Specification of embedded real time systems, in: Proc. Workshop on Real Time Systems, IEEE Computer Society Press, 1992.
10. L. Stockmeyer, The complexity of decision problems in automata and logic, Ph.D. Thesis, MIT, Cambridge, MA, 1974.
11. L. Stockmeyer, A.R. Meyer, Word problems requiring exponential time: preliminary report, in: Proc. 5th AMS Symposium on Theory of Computing, 1973.
12. Zhou Chaochen, M.R. Hansen, M. Hansen, Duration Calculus: logical foundations, Formal Aspects of Computing 9 (1997) 283-330.
13. Zhou Chaochen, M.R. Hansen, P. Sestoft, Decidability and undecidability results for Duration Calculus, in: STACS'93. Lecture Notes in Comput. Sci., Vol. 665, Springer, Berlin, 1993, pp. 58-68.
14. Zhou Chaochen, C.A.R. Hoare, A.P. Ravn, A calculus of Duration, Inform. Process. Lett. 40 (5) (1991) 269-279.