ACTL ∩ LTL Synthesis
暂无分享,去创建一个
[1] Giacomo Lenzi,et al. On the relationship between monadic and weak monadic second order logic on arbitrary trees, with applications to the mu-calculus , 2003 .
[2] Rüdiger Ehlers,et al. Unbeast: Symbolic Bounded Synthesis , 2011, TACAS.
[3] Krishnendu Chatterjee,et al. Robustness in the Presence of Liveness , 2010, CAV.
[4] Roderick Bloem,et al. Anzu: A Tool for Property Synthesis , 2007, CAV.
[5] Marco Pistore,et al. NuSMV 2: An OpenSource Tool for Symbolic Model Checking , 2002, CAV.
[6] E. Allen Emerson,et al. Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[7] Jean-François Raskin,et al. Compositional Algorithms for LTL Synthesis , 2010, ATVA.
[8] Kousha Etessami,et al. Analysis of Recursive Game Graphs Using Data Flow Equations , 2004, VMCAI.
[9] Amir Pnueli,et al. Specify, Compile, Run: Hardware from PSL , 2007, COCV@ETAPS.
[10] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[11] Rajeev Alur,et al. A Temporal Logic of Nested Calls and Returns , 2004, TACAS.
[12] Rüdiger Ehlers,et al. Generalized Rabin(1) Synthesis with Applications to Robust System Synthesis , 2011, NASA Formal Methods.
[13] Ian Stark,et al. Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.
[14] Amir Pnueli,et al. Synthesis of Reactive(1) Designs , 2006, VMCAI.
[15] Rüdiger Ehlers,et al. Minimising Deterministic Büchi Automata Precisely Using SAT Solving , 2010, SAT.
[16] Ofer Strichman,et al. Theory and Applications of Satisfiability Testing – SAT 2010 , 2010, Lecture Notes in Computer Science.
[17] K. Hashiguchi,et al. Representation Theorems on Regular Languages , 1983, J. Comput. Syst. Sci..
[18] Thomas R. Shiple,et al. Building Circuits from Relations , 2000, CAV.
[19] Jean-François Raskin,et al. An Antichain Algorithm for LTL Realizability , 2009, CAV.
[20] Rüdiger Ehlers,et al. Symbolic bounded synthesis , 2010, Formal Methods Syst. Des..
[21] Somesh Jha,et al. An Improved Algorithm for the Evaluation of Fixpoint Expressions , 1997, Theor. Comput. Sci..
[22] Luca de Alfaro,et al. An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games , 2007, CAV.
[23] Fabio Somenzi,et al. CUDD: CU Decision Diagram Package Release 2.2.0 , 1998 .
[24] M. Maidi. The common fragment of CTL and LTL , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[25] Rüdiger Ehlers,et al. Experimental Aspects of Synthesis , 2011, iWIGP.
[26] C. Baier,et al. Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic , 2005 .
[27] Paul Gastin,et al. Fast LTL to Büchi Automata Translation , 2001, CAV.
[28] Robert McNaughton,et al. Infinite Games Played on Finite Graphs , 1993, Ann. Pure Appl. Logic.
[29] E. Emerson,et al. Tree Automata, Mu-Calculus and Determinacy (Extended Abstract) , 1991, FOCS 1991.
[30] Kousha Etessami,et al. Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata , 2001, ICALP.
[31] Marcin Jurdzinski,et al. Small Progress Measures for Solving Parity Games , 2000, STACS.
[32] Mohamed Nassim Seghir,et al. A Lightweight Approach for Loop Summarization , 2011, ATVA.
[33] Monika Maidl,et al. The Common Fragment of CTL and LTL , 2000, FOCS.
[34] Mikolaj Bojanczyk. The Common Fragment of ACTL and LTL , 2008, FoSSaCS.
[35] Edmund M. Clarke,et al. Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..
[36] Fabio Somenzi,et al. Safety first: A two-stage algorithm for LTL games , 2009, 2009 Formal Methods in Computer-Aided Design.
[37] Amir Pnueli,et al. Automatic Hardware Synthesis from Specifications: A Case Study , 2007 .