Timed Temporal Logics.
Lecture Notes in Computer Science(2017)
摘要
Since the early 1990's, classical temporal logics have been extended with timing constraints. While temporal logics only express contraints on the order of events, their timed extensions can add quantitative constraints on delays between those events. We survey expressiveness and algorithmic results on those logics, and discuss semantic choices that may look unimportant but do have an impact on the questions we consider.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络