On expressive completeness of duration and mean value calculi (extended abstract)

Electronic Notes in Theoretical Computer Science

Volumn 7, Issue , 1997, Pages 248-261

  Rabinovich, Alexander ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; LOGIC PROGRAMMING; MATHEMATICAL OPERATORS; REAL TIME SYSTEMS; SPECIFICATIONS; THEOREM PROVING;

ATOMIC FORMULAE; DURATION CALCULUS (DC); FIRST-ORDER MONADIC LOGIC; KAMP'S THEOREM;

FORMAL LOGIC;

EID: 18944383086     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80476-1     Document Type: Conference Paper

References (25)

1. Burgess J., Gurevich Y. The decision problem for linear temporal logic. Notre Dame J. Formal Logic. 26:(2):1985;115-128
2. Gabbay D., Hodkinson I., Reynolds M. Temporal Logic. 1994;Oxford Un. Press
3. Gabbay D., Pnueli A., Shelah S., Stavi J. On the temporal analysis of fairness. 7th ACM Symp. on Principles of Prog. Lang. 1980;163-173
4. Y. Gurevich. Monadic second order theories. In J. Barwise and S. Feferman eds., Model theoretical logics, pp. 479-506, Springer Verlag.
5. Halperin J., Moszkowski B., Manna Z. A prepositional modal logic of time intervals. LICS. 1986;279-292
6. M. R. Hansen and Zhou Chaochen. Duration Calculus: Logical Foundations. Technical Report, Technical University of Denmark, 1996.
7. H. Kamp. Tense logic and the theory of linear order. Ph.D. Thesis, Un. of California at LA, 1968.
8. Lamport L. The Temporal Logic of Actions. ACM Transactions on Programming Languages and Systems. 16:(3):1994;872-923
9. A. R. Meyer and L. Stockmeyer. Non-elementary word problems in automata and logic. In Proc. AMS Symposium on Complexity of Computation, 1973.
10. McNaughton R., Papert S. Counter-free automata. 1971;The MIT Press
11. Monk J.D. Mathematical Logic. 1976;Springer-Verlag
12. B. Moszkowski. Reasoning about Digital Circuits. Ph. D thesis, Stanford, 1983.
13. P. Pandya. Some extensions to Propositional Mean Value Calculus: Expressiveness and Decidability. In Proceedings of Computer Science Logic 1995, LNCS.
14. Rabinovich A. A Universal Continuous Time Specification Formalism. Submitted for publication. Sept. 1996
15. A. Rabinovich. On Translation of Temporal Logic of Actions into Monadic Second Order Logic. To appear in Theoretical Computer Science.
16. A. Rabinovich. Star Free expressions over the reals. To appear in Theoretical Computer Science.
17. A. Rabinovich. Non-elementary Lower Bound for Propositional Duration Calculus. Technical Report, Tel-Aviv University, May 1997.
18. A. Ravn. Design of Embedded Real Time Computing Systems, Technical Report, Technical University of Denmark, 1995.
19. Ravn A., Richel H., Hansen K. Specifying and verifying requirement of real time systems. IEEE Transaction on Software Eng. 1993
20. J. Skakkebak, A. Ravn, H. Richel, Zhou Chaochen. Specification of Embedded Real time Systems. In Proc. of 1992 Euromicro workshop on Real Time Systems. IEEE Computer Society Press.
21. Shelah S. The monadic theory of order. Ann. of Math. 102:1975;349-419
22. L. Stockmeyer. The complexity of decision problems in automata and logic, Ph.D. Thesis, MIT, 1974.
23. Chaochen Zhou, Hansen M.R., Sestoft P. Decidability and undecidablity results for Duration Calculus. STAGS'93, Led. Notes in Comp. Sci. vol. 665:1993;58-68
24. Chaochen Zhou, Hoare C.A.R., Ravn A.P. A calculus of Duration. Information processing Letters. 40:(5):1991;269-279
25. Chaochen Zhou, Xiaoshan Li. A mean value calculus of duration. A classical Mind: Essays in Honor of C. A. R. Hoare. 1994;431-451 Prentice Hall