Decidability of Quantifed Propositional Branching Time Logics
暂无分享,去创建一个
[1] Yoram Moses,et al. Knowledge and the Logic of Local Propositions , 1998, TARK.
[2] Edmund M. Clarke,et al. Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.
[3] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.
[4] E. Allen Emerson,et al. Alternative Semantics for Temporal Logics , 1981, Theor. Comput. Sci..
[5] Amir Pnueli,et al. The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[6] Amir Pnueli,et al. Once and for all [temporal logic] , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.
[7] Nils Klarlund,et al. Progress measures, immediate determinacy, and a subset construction for tree automata , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.
[8] Martín Abadi,et al. The existence of refinement mappings , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.
[9] Philip Kremer. On the Complexity of Propositional Quantification in Intuitionistic Logic , 1997, J. Symb. Log..
[10] M. Rabin. Decidability of second-order theories and automata on infinite trees. , 1969 .
[11] A. Prasad Sistla,et al. Deciding Full Branching Time Logic , 1985, Inf. Control..
[12] Aravinda Prasad Sistla,et al. Theoretical issues in the design and verification of distributed systems , 1983 .
[13] Orna Kupferman. Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions , 1995, CAV.
[14] Saharon Shelah,et al. The Decision Problem for Branching Time Logic , 1985, J. Symb. Log..
[15] Orna Grumberg,et al. Branching Time Temporal Logic and Amorphous Tree Automata , 1993, CONCUR.
[16] Amir Pnueli,et al. A complete proof systems for QPTL , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.
[17] David Harel,et al. Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness , 1986, JACM.
[18] A. Visser. Bisimulations, model descriptions and propositional quantifiers , 1996 .