COMPUTABLE SEMANTICS FOR CTL* ON DISCRETE-TIME AND CONTINUOUS-SPACE DYNAMIC SYSTEMS

被引:1
作者
Collins, Pieter [1 ]
Zapreev, Ivan S. [1 ]
机构
[1] Ctr Wiskunde & Informat, NL-1098 XG Amsterdam, Netherlands
关键词
Computability; model checking; CTL; LTL; computable semantics; dynamic systems; TEMPORAL LOGIC; SETS;
D O I
10.1142/S012905411100843X
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this work, we consider Discrete-Time Continuous-Space Dynamic Systems for which we study the computability of the standard semantics of CTL* (CTL, LTL) and provide a variant thereof computable in the sense of Type-2 Theory of Effectivity. In particular, we show how the computable model checking of existentially and universally quantified path formulae of LTL can be reduced to solving, respectively, repeated reachability and persistence problems on a model obtained as a parallel composition of the original one and a non-deterministic Buchi automaton corresponding to the verified LTL formula.
引用
收藏
页码:801 / 821
页数:21
相关论文
共 17 条