Non-deterministic temporal logics for general flow systems

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

Volumn 2993, Issue , 2004, Pages 280-295

  Davoren, Jennifer M ^a   Coulthard, Vangham ^a,b   Markey, Nicolas ^c   Moor, Thomas ^d  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^c UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^d UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FORMAL LOGIC; HYBRID SYSTEMS; SEMANTICS; TEMPORAL LOGIC;

ARBITRARY TIME; COMPUTATION TREE LOGIC; CONTINUOUS-TIME; DIFFERENTIAL INCLUSIONS; HYBRID AUTOMATONS; PROOF SYSTEM; TIME SYSTEMS; TRANSITION SYSTEM;

CONTINUOUS TIME SYSTEMS;

EID: 33847000790     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24743-2_19     Document Type: Article

References (18)

1. R. Alur, T. A. Henzinger, and P.-H. Ho. Automatic symbolic verification of embedded systems. IEEE Transactions on Software Engineering, 22:181-201, 1996.
2. R. Alur, T.A. Henzinger, G. Lafferriere, and G. Pappas. Discrete abstractions of hybrid systems. Proceedings of the IEEE, 88, July 2000.
3. J.-P. Aubin. Viability kernels and capture basins of sets under differential inclusions. Siam Journal of Control, 40:853-881, 2001.
4. J.-P. Aubin. Viability kernels and capture basins: Lecture notes. Technical report, Universidad Politecnica de Cartagena, Spain, April-May 2002.
5. J.-P. Aubin and O. Dordan. Dynamical qualitative analysis of evolutionary systems. In Hybrid Systems: Computation and Control, LNCS 2289, pages 62-75. Springer-Verlag, 2002.
6. J.-P. Aubin and H. Frankowska. Set-Valued Analysis. Birkhauser, Boston, 1990.
7. J.-P. Aubin, J. Lygeros, M. Quincampoix, S. Sastry, and N. Seube. Impulse differential inclusions: A viability approach to hybrid systems. IEEE Transactions on Automatic Control, 47:2-20, 2002.
8. J.P. Burgess. Axioms for tense logic I: "Since" and "Until". Notre Dame Journal of Formal Logic, 23:367-374, 1982.
9. V. Coulthard. Temporal Logics of Dynamical Systems in Discrete and Dense Time. PhD thesis, RSISE, The Australian National University, 2004. In preparation.
10. E. A. Emerson and J. Y. Halpern. "Sometimes" and "Not Never" revisited: on branching versus linear time. Journal of the Association of Computing Machinery, 33:151-178,1986.
11. thIEEE Foundations of Computer Science (FOCS'88). IEEE, 1988.
12. E.A. Emerson and A. Sistla. Deciding Full Branching Time Logic. Information and Control, 61:175-201, 1984.
13. D.M. Gabbay, I. Hodkinson, and M. Reynolds. Temporal Logic: Mathematical Foundations and Computational Aspects, Volume 1. Clarendon Press, Oxford, 1994.
14. T.A. Henzinger. The theory of hybrid automata. In Proc. of 11th Annual IEEE Symposium on Logic in Computer Science, pages 278-292, 1996.
15. J. Lygeros, K.H. Henrik, S.N. Simic, and S.S. Sastry. Dynamical properties of hybrid automata. IEEE Transactions on Automatic Control, 48:2-17, 2003.
16. M. Reynolds. An Axiomatization of Full Computation Tree Logic. J. Symbolic Logic, 66:1011-1057, 2001.
17. C. Stirling. Modal and temporal logics. In Handbook of Logic in Computer Science, volume 2, pages 477-563. Oxford University Press, 1992.
18. J.C. Willems. Paradigms and puzzles in the theory of dynamical systems. IEEE Transactions on Automatic Control, 36:259-294, 1991.