Predicting learnt clauses quality in modern SAT solvers, IJCAI'09, pp.399-404, 2009. ,
Compositional Approach to Suspension and Other Improvements to LTL Translation, SPIN'13, pp.81-98, 2013. ,
DOI : 10.1007/978-3-642-39176-7_6
Principles of Model Checking, 2008. ,
Efficient Decision Procedures for Model Checking of Linear Time Logic Properties, CAV'99, pp.222-235, 1999. ,
DOI : 10.1007/3-540-48683-6_21
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables, IJCAR'01, pp.611-625, 2001. ,
DOI : 10.1007/3-540-45744-5_50
Relating hierarchy of temporal properties to model checking, MFCS'03, pp.318-327, 2003. ,
Advanced automata minimization, POPL'13, pp.63-74, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00949520
On-the-fly emptiness checks for generalized Büchi automata, SPIN'05, pp.143-158, 2005. ,
Mechanizing the Powerset Construction for Restricted Classes of ??-Automata, ATVA'07, 2007. ,
DOI : 10.1007/978-3-540-75596-8_17
LTL translation improvements in Spot, VECoS'11, 2011. ,
Minimising deterministic Büchi automata precisely using SAT solving, SAT'10, pp.326-332, 2010. ,
DOI : 10.1007/978-3-642-14186-7_28
Rabinizer: Small deterministic automata for LTL(F,G), ATVA'12, pp.95-109, 2012. ,
Uniform Distributed Synthesis, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.321-330, 2005. ,
DOI : 10.1109/LICS.2005.53
Experiments with Deterministic ??-Automata for Formulas of Linear Temporal Logic, Theoretical Computer Science, vol.363, pp.182-195, 2005. ,
DOI : 10.1007/11605157_17
Deterministic ?-automata vis-avis deterministic Büchi automata, ISAAC'94, pp.378-386, 1994. ,
DOI : 10.1007/3-540-58325-4_202
Efficient minimization of deterministic weak -automata, Information Processing Letters, vol.79, issue.3, pp.105-109, 2001. ,
DOI : 10.1016/S0020-0190(00)00183-6
On syntactic congruences for ?-languages, STACS'93, pp.586-594, 1993. ,
A hierarchy of temporal properties, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing , PODC '87, pp.377-410, 1990. ,
DOI : 10.1145/41840.41857
A Multi-encoding Approach for LTL Symbolic Satisfiability Checking, FM'11, pp.417-431, 2011. ,
DOI : 10.1006/inco.1994.1092
Complexity of Automata on Infinite Objects The Weizmann Institute of Science, 1989. ,
Beyond hyper-minimisation?minimising DBAs and DPAs is NPcomplete, FSTTCS'10, pp.400-411, 2010. ,
Tight bounds for the determinisation and complementation of generalised Büchi automata, ATVA'12, pp.42-56, 2012. ,