Mixed decision method for duration calculus

Journal of Logic and Computation

Volumn 10, Issue 6, 2000, Pages 877-895

  Chetcuti Serandio, Nathalie ^a   Del Cerro, Luis Fariñas ^a  

^a IRIT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; CONSTRAINT THEORY; DECISION THEORY; MATHEMATICAL OPERATORS; REAL TIME SYSTEMS; SEMANTICS; SOFTWARE ENGINEERING; THEOREM PROVING;

ALLENS INTERVAL ALGEBRA; AUTOMATED DEDUCTION; DURATION CALCULUS; INTERVAL LOGIC; MIXED DECISION METHOD; TIME REPRESENTATION;

FORMAL LOGIC;

EID: 0034499759     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/10.6.877     Document Type: Article

References (14)

1. J. F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26, 832-843, 1983.
2. R. Dechter, I. Meiri and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49, 61-95, 1991.
3. M. Fränzle. Synthesizing Controllers from Duration Calculus. In Formal Techniques in Real-Time and Fault-Tolerant Systems, 4th International Symposium, Uppsala, Sweden, B. Jonsson and J. Parrow, eds., pp. 168-187. Vol. 1135 of Lecture Notes in Computer Science, Springer-Verlag, 1996.
4. A. Gerevini and M. Cristani. On finding a solution in temporal constraint satisfaction problem. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI 97, Nagoya, Japan, Volume 2, pp. 1460-1465, Morgan Kaufmann, 1997.
5. M. R. Hansen and C. Zhou. Semantics and completeness of duration calculus. In Real-Time: Theory in Practice, REX Workshop, W.-P. de Roever, J. W. de Bakker, C. Huizing and G. Rozenberg, eds., pp. 209-225. Volume 600 of Lecture Notes in Computer Science, Springer-Verlag, 1992.
6. M. R. Hansen and C. Zhou. Duration Calculus: logical foundations. Formal Aspects of Computing, 9, 283-330, 1997.
7. B. Moszkowski. A temporal logic for multilevel reasoning about hardware. Computer, 18, 10-19, 1985.
8. A. P. Ravn, H. Rischel and K. M. Hansen. Specifying and verifying requirements of real-time systems. IEEE Transactions on Software Engineering, Special Issue on Software for Critical Systems, 19, 41-55, 1993.
9. J. U. Skakkebæk and P. Sestoft. Checking validity of duration calculus formulas. Technical Report ID/DTH JUS 3/1, Department of Computer Science, Technical University of Denmark, 2800 Lyngby, Denmark, March 1994. available at ftp://ftp.it.dtu.dk/pub/ProCoS/Jens.U.Skakkebaek /IDDTH-JUS-3-1.ps.Z.
10. Y. Venema. A modal logic for chopping intervals. Journal of Logic and Computation, 1, 453-476, 1991.
11. Z. Yuhua and C. Zhou. A formal proof of the deadline driven scheduler. In Formal Techniques in Real-Time and Fault-Tolerant Systems, Third International Symposium, H. Langmaack, W.-P. de Roever, and J. Vytopil, eds., pp. 756-775. Volume 863 of Lecture Notes in Computer Science, Springer-Verlag, 1994.
12. C. Zhou, M. R. Hansen, A. P. Ravn and H. Rischel. Duration specifications for shared processors. In Formal Techniques in Real-Time and Fault-Tolerant Systems, Second International Symposium, J. Vytopil, editor, pp. 21-32. Volume 571 of Lecture Notes in Computer Science, Springer-Verlag, 1992.
13. C Zhou, M. R. Hansen and P. Sestoft. Decidability and undecidability results for duration calculus. In STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, P. Enjalbert, A. Finkel and K. W. Wagner, eds., pp. 58-68. Volume 665 of Lecture Notes in Computer Science, Springer-Verlag, 1993.
14. C. Zhou, C. A. R. Hoare and A. P. Ravn. A calculus of durations. Information Processing Letters, 40, 269-276, North-Holland, 1991.