A complete fragment of higher-order duration μ-calculus

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

Volumn 1974, Issue , 2000, Pages 264-276

  Guelev, Dimitar P ^a,b  

^a UNITED NATIONS UNIVERSITY   (Macao)

^b INSTITUTE OF MATHEMATICS AND INFORMATICS   (Bulgaria)

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE ENGINEERING; TEMPORAL LOGIC;

COMPLETENESS THEOREMS; DATA MANIPULATIONS; DURATION CALCULUS; FIXED POINTS; HIGHER-ORDER; MU-CALCULUS; PROOF SYSTEM; RECURSIONS;

CALCULATIONS;

EID: 84947800431     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44450-5_21     Document Type: Conference Paper

References (21)

1. Dang Van Hung and D. P. Guelev. Completeness and Decidability of a Fragment of Duration Calculus with Iteration. In: P.S. Thiagarajan and R. Yap (eds), Advances in Computing Science, LNCS 1742, Springer-Verlag, 1999, pp. 139-150.
2. Dang Van Hung and Wang Ji. On The Design of Hybrid Control Systems Using Automata Models. In: Chandru, V. and V. Vinay (eds.) LCNS 1180, Foundations of Software Technology and Theoretical Computer Science, 16th Conference, Hyderabad, India, December 1996, Springer, 1996.
3. Dutertre, B. On First Order Interval Temporal Logic. Report no. CSDTR-94-3 Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, England, 1995.
4. Guelev, D. P. Iteration of Simple Formulas in Duration Calculus. Tech. report 141, UNU/IIST, June 1998.
5. Guelev, D. P. Probabilistic and Temporal Modal Logics, Ph.D. thesis, submitted, January 2000.
6. Guelev, D. P. A Complete Fragment of Higher-Order Duration μ-Calculus. Tech. Report 195, UNU/IIST, April 2000.
7. He Jifeng and Xu Qiwen. Advanced Features of DC and Their Applications. Proceedings of the Symposium in Celebration of the Work of C.A.R. Hoare, Oxford, 13-15 September, 1999.
8. M. R. Hansen and Zhou Chaochen. Semantics and Completeness of Duration Calculus. Real-Time: Theory and Practice, LNCS 600, Springer-Verlag, 1992, pp. 209-225.
9. Kozen, D. Results on the propositional μ-calculus. TCS 27:333-354, 1983.
10. Li Li and He Jifeng. A Denotational Semantics of Timed RSL using Duration Calculus. Proceedings of RTCSA’99, pp. 492-503, IEEE Computer Society Press, 1999.
11. Mendelson, E. Introduction to Mathematical Logic. Van Nostrand, Princeton, 1964.
12. Pandya, P. K. Some Extensions to Propositional Mean-Value Calculus. Expressiveness and Decidability. Proceedings of CSL’95, Springer-Verlag, 1995.
13. Pandya, P. K. and Y Ramakrishna. A Recursive Duration Calculus. Technical Report TCS-95/3, TIFR, Bombay, 1995.
14. Pandya, P. K, Wang Hanping and Xu Qiwen. Towards a Theory of Sequential Hybrid Programs. Proc. IFIP Working Conference PROCOMET’98D. Gries and W.-P. de Roever (eds.), Chapman & Hall, 1998.
15. Schneider, G. and Xu Qiwen. Towards a Formal Semantics of Verilog Using Duration Calculus. Proceedings of FTRTFT’98, Anders P. Ravn and Hans Rischel (eds.), LNCS 1486, pp. 282-293, Springer-Verlag, 1998.
16. Walurkiewicz, I. A Complete Deductive System for the μ-Calculus., Ph.D. Thesis, Warsaw University, 1993.
17. Zhou Chaochen, D. P. Guelev and Zhan Naijun. A Higher-Order Duration Calculus. Proceedings of the Symposium in Celebration of the Work of C.A.R. Hoare, Oxford, 1999.
18. Zhou Chaochen and M. Hansen Chopping a Point. Proceedings of BCS FACS 7th Refinement Workshop, Electronic Workshop in Computer Sciences, Springer-Verlag, 1996.
19. Zhu Huibiao and He Jifeng. A DC-base d Semantics for Verilog Tech.Report 183, UNU/IIST, January 2000.
20. Zhou Chaochen, C. A. R. Hoare and A. P. Ravn. A Calculus of Durations. Information Processing Letters, 40(5), pp. 269-276, 1991.
21. Zhan Naijun. Completeness of Higher-Order Duration Calculus. Research Report 175, UNU/IIST, August 1999.