Rabinizer: Small Deterministic Automata for LTL(F, G)
暂无分享,去创建一个
[1] Christel Baier,et al. Principles of Model Checking (Representation and Mind Series) , 2008 .
[2] C. Baier,et al. Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic , 2005 .
[3] Vojtech Rehák,et al. LTL to Büchi Automata Translation: Fast and More Deterministic , 2012, TACAS.
[4] Wolfgang Thomas,et al. Observations on determinization of Büchi automata , 2005, Theor. Comput. Sci..
[5] Fabio Somenzi,et al. Efficient Büchi Automata from LTL Formulae , 2000, CAV.
[6] Radek Pelánek,et al. BEEM: Benchmarks for Explicit Model Checkers , 2007, SPIN.
[7] Andreas Podelski,et al. ACSAR: Software Model Checking with Transfinite Refinement , 2007, SPIN.
[8] Krishnendu Chatterjee,et al. Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis , 2013, CAV.
[9] Paul Gastin,et al. Fast LTL to Büchi Automata Translation , 2001, CAV.
[10] S. Safra,et al. On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[11] Rajeev Alur,et al. Deterministic generators and games for Ltl fragments , 2004, TOCL.
[12] Christel Baier,et al. Principles of model checking , 2008 .
[13] Marta Z. Kwiatkowska,et al. PRISM 4.0: Verification of Probabilistic Real-Time Systems , 2011, CAV.
[14] Jan Kretínský,et al. Deterministic Automata for the (F,G)-fragment of LTL , 2012, CAV.
[15] Mohamed Nassim Seghir,et al. A Lightweight Approach for Loop Summarization , 2011, ATVA.
[16] Rajeev Alur,et al. A Temporal Logic of Nested Calls and Returns , 2004, TACAS.