A theory of duration calculus with application

作者: Michael Reichhardt Hansen , Dang Van Hung

DOI: 10.1007/978-3-540-74964-6_3

关键词: Duration calculusCalculusNatural deductionAlgorithmProcess calculusSemantics (computer science)Situation calculusDecidabilityCalculus of communicating systemsComputer scienceProof calculus

摘要: In this chapter we will present selected central elements in the theory of Duration Calculus and give examples applications. The cover syntax, semantics proof system for basic logic. Furthermore, results on decidability, undecidability model-checking be presented. A few extensions calculus described, particular, Hybrid with iterations. a case study: biphase mark protocol, is We not attempt to exhaustive our coverage topics; but provide references further study.

参考文章(84)
Paritosh K. Pandya, Dang Van Hung, Manoranjan Satpathy, Some Results on the Decidability of Duration Calculus under Synchronous Interpretation Lecture Notes in Computer Science. ,(1996)
Zhou Chaochen, Michael R. Hansen, Peter Sestoft, Decidability and Undecidability Results for Duration Calculus symposium on theoretical aspects of computer science. pp. 58- 68 ,(1993) , 10.1007/3-540-56503-5_8
Arthur Li, Omran Bukhres, Overall system for secure wireless mobile networks Concurrency and Parallelism, Programming, Networking, and Security. pp. 351- 352 ,(1996) , 10.1007/BFB0027814
Kim Guldstrand Larsen, Jacob Illum Rasmussen, Optimal Conditional Reachability for Multi-priced Timed Automata Foundations of Software Science and Computational Structures. pp. 234- 249 ,(2005) , 10.1007/978-3-540-31982-5_15
Zhao Jianhua, Dang Van Hung, On Checking Parallel Real-Time Systems for Linear Duration Properties Lecture Notes in Computer Science. pp. 241- 250 ,(1998) , 10.1007/BFB0055351
Y. Kesten, A. Pnueli, J. Sifakis, S. Yovine, Integration Graphs: A Class of Decidable Hybrid Systems Hybrid Systems. pp. 179- 208 ,(1993) , 10.1007/3-540-57318-6_29