LTL is closed under topological closure
暂无分享,去创建一个
[1] Fred Kröger,et al. Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.
[2] Paul Gastin,et al. First-order definable languages , 2008, Logic and Automata.
[3] Amir Pnueli,et al. In and out of temporal logic , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.
[4] Leslie Lamport,et al. Proving the Correctness of Multiprocess Programs , 1977, IEEE Transactions on Software Engineering.
[5] R. McNaughton,et al. Counter-Free Automata , 1971 .
[6] Pierre Wolper. Temporal Logic Can Be More Expressive , 1983, Inf. Control..
[7] Bengt Jonsson,et al. Assumption/Guarantee Specifications in Linear-Time Temporal Logic , 1996, Theor. Comput. Sci..
[8] Robert McNaughton,et al. Counter-Free Automata (M.I.T. research monograph no. 65) , 1971 .
[9] Amir Pnueli,et al. The Glory of the Past , 1985, Logic of Programs.
[10] Wolfgang Thomas,et al. Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[11] Patrick Maier. Intuitionistic LTL and a New Characterization of Safety and Liveness , 2004, CSL.
[12] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[13] Pierre Wolper,et al. Simple on-the-fly automatic verification of linear temporal logic , 1995, PSTV.
[14] Bowen Alpern,et al. Recognizing safety and liveness , 2005, Distributed Computing.
[15] Bowen Alpern,et al. Defining Liveness , 1984, Inf. Process. Lett..