On the complexity of computing minimal unsatisfiable LTL formulas

Lakhdar Saïs 1 Mohand-Said Hacid 2 François Hantry 2
1 CRIL - Centre de Recherche en Informatique de Lens
2 BD - Base de Données
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Keywords : vacuity checking minimal unsatisfiable ltl formulas logic cause debuging automata
Document type :
Journal articles
Complete list of metadatas
https://hal.archives-ouvertes.fr/hal-00870901
Contributor : Francois Chevallier <>
Submitted on : Tuesday, October 8, 2013 - 12:28:29 PM
Last modification on : Tuesday, February 26, 2019 - 11:49:40 AM

Identifiers

  • HAL Id : hal-00870901, version 1

Collections

UNIV-ARTOIS | UNIV-LYON2 | EC-LYON | LIRIS | INSA-LYON | UNIV-LYON1 | INSA-GROUPE | LABEXIMU

Citation

Lakhdar Saïs, Mohand-Said Hacid, François Hantry. On the complexity of computing minimal unsatisfiable LTL formulas. Electronic Colloquium on Computational Complexity, Hasso Plattner Institute, 2012, 19, pp.69. ⟨http://eccc.hpi-web.de/report/2012/069/⟩. ⟨hal-00870901⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

174

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD