Computable semantics for CTL* on discrete time and continuous space dynamic systems

Pieter Collins, Ivan S. Zapreev*

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review


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 B??chi automaton corresponding to the verified LTL formula.
Original languageEnglish
Pages (from-to)801-821
Number of pages21
JournalInt. J. Found. Comput. Sci.
Issue number4
Publication statusPublished - 2011

Cite this