The Complexity of Linear-Time Temporal Logic Model Repair

被引:1
|
作者
Tao, Xiuting [1 ]
Li, Guoqiang [1 ]
机构
[1] Shanghai Jiao Tong Univ, Sch Software, Shanghai, Peoples R China
基金
美国国家科学基金会;
关键词
D O I
10.1007/978-3-319-90104-6_5
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We propose the model repair problem of the linear-time temporal logic. Informally, the repair problem asks for a minimum set of states in a given Kripke structure M, whose modification can make the given LTL formula satisfiable. We will examplify the application of the model and study the computational complexity of the problem. We will show the problem can be solved in exponential time but remains NP-hard even if k is a constant.
引用
收藏
页码:69 / 87
页数:19
相关论文
共 50 条