Computable CTL* for discrete-time and continuous-space dynamic systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5797 LNCS, Issue , 2009, Pages 107-119

  Collins, Pieter ^a   Zapreev, Ivan S ^a  

^a CWI   (Netherlands)

Author keywords

Computability; CTL*; Dynamic systems; Model checking

Indexed keywords

2-THEORIES; COMPLEXITY THEORY; COMPUTABILITY; COUNTABLE STATE SPACE; DISCRETE-TIME; DYNAMIC SYSTEMS; MODEL CHECKING PROBLEM; MODEL-CHECKING ALGORITHMS; SPACE DYNAMICS;

COMPUTATIONAL COMPLEXITY; CONTINUOUS TIME SYSTEMS; DIGITAL COMPUTERS; DYNAMIC PROGRAMMING; DYNAMICAL SYSTEMS; MODELS; SEMANTICS;

MODEL CHECKING;

EID: 70349952310     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04420-5_11     Document Type: Conference Paper

References (20)

1. Artemov, S.N., Davoren, J.M., Nerode, A.: Logic, Topological Semantics and Hybrid Systems. In: International Conference on Decision and Control, CDC 1997, vol.1, pp. 698-701. IEEE Press, Los Alamitos (1997)
2. Balluchi, A., Casagrande, A., Collins, P., Ferrari, A., Villa, T., Sangiovanni-Vincentelli, A.L.: Ariadne: A Framework for Reachability Analysis of Hybrid Automata. In: Symposium on Mathematical Theory of Networks and Systems (MTNS 2006), Kyoto, Japan (July 2006) (to appear)
3. Brattka, V., Presser, G.: Computability on subsets of metric spaces. Theoretical Computer Science 305(1-3), 43-76 (2003)
4. Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. AMC Transactions On Programming Languages And Systems 8(2), 244-263 (1986)
5. Clarke, E.M., Draghicescu, I.A.: Expressibility Results for Linear-Time and Branching-Time Logics. In: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, London, UK, pp. 428-437. Springer, Heidelberg (1989)
6. Collins, P.: Continuity and computability of reachable sets. Theoretical Computer Science 341(1), 162-195 (2005)
7. Collins, P.: Optimal Semicomputable Approximations to Reachable and Invariant Sets. Theory of Computing Systems 41(1), 33-48 (2007)
8. Collins, P.J., Zapreev, I.S.: Computable CTL for Discrete-Time and Continuous- Space Dynamic Systems. Technical Report MAS-E0903, MAS, Centrum Wiskunde & Informatica (2009), http://www.cwi.nl/ftp/CWIreports/MAS/MAS- E0903.pdf
9. Collins, P.J., Zapreev, I.S.: Computable CTL for Discrete-Time and Continuous- Space Dynamic Systems. In: Computability in Europe, CiE (2009), To be published in a local pre-conference proceedings volume
10. Emerson, E.A., Halpern, J.Y.: "sometimes" and "Not Never" Revisited: On Branching versus Linear Time Temporal Logic. Journal of the Association for Computing Machinery (ACM) 33(1), 151-178 (1986)
11. Kozen, D.: Results on the propositional ì-calculus. Research Report RC 10133 (44981), IBM Research Division, August 1983, p. 42 (1983)
12. Kremer, P., Mints, G.: Dynamic topological logic. Annals of Pure and Applied Logic 131(1-3), 133-158 (2005)
13. Kupferman, O., Vardi, M.Y.: From Linear Time to Branching Time. ACM Transactions on Computational Logic (TOCL) 6(2), 273-294 (2005)
14. Maidl, M.: The Common Fragment of CTL and LTL. In: Annual Symposium on Foundations of Computer Science, FOCS 2000, pp. 643-652. IEEE Computer Society, Los Alamitos (2000)
15. Nerode, A., Kohn, W.: Models for Hybrid Systems: Automata, Topologies, Controllability, Observability. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol.736, pp. 317-356. Springer, Heidelberg (1993)
16. Pnueli, A.: The Temporal Semantics of Concurrent Programs. In: Kahn, G. (ed.) Semantics of Concurrent Computation. LNCS, vol.70, pp. 1-20. Springer, Heidelberg (1979)
17. Schneider, K.: Verification of Reactive Systems: Formal Methods and Algorithms. In: TTCSS. Springer, Heidelberg (2004)
18. Schnoebelen, P.: The complexity of temporal logic model checking. In: Balbiani, P., Suzuki, N.-Y., Wolter, F., Zakharyaschev, M. (eds.) Selected Papers from the 4th Workshop on Advances in Modal Logics (AiML), Toulouse, France, pp. 393-436. King's College Publication (2003)
19. Spreen, D.: On the Continuity of Effective Multifunctions. Electron. Notes Theor. Comput. Sci. 221, 271-286 (2008)
20. Weihrauch, K.: Computable Analysis: An Introduction. Springer, New York (2000)