时态逻辑
线性时序逻辑
可实现性
行动的时间逻辑
区间时态逻辑
计算机科学
计算树逻辑
模型检查
理论计算机科学
动态逻辑(数字电子)
多模态逻辑
程序设计语言
描述逻辑
物理
晶体管
电压
量子力学
作者
Rajeev Alur,Thomas A. Henzinger,Orna Kupferman
出处
期刊:Foundations of Computer Science
日期:1997-10-19
被引量:144
标识
DOI:10.1109/sfcs.1997.646098
摘要
Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branching-time temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general variety of temporal logic: alternating-time temporal logic offers selective quantification over those paths that are possible outcomes of games, such as the game in which the system and the environment alternate moves. While linear-time and branching-time logics are natural specification languages for closed systems, alternating-time logics are natural specification languages for open systems. For example, by preceding the temporal operator eventually with a selective path quantifier, we can specify that in the game between the system and the environment, the system has a strategy to reach a certain state. Also the problems of receptiveness, realizability, and controllability can be formulated as model-checking problems for alternating-time formulas.
科研通智能强力驱动
Strongly Powered by AbleSci AI