The Complexity of Generalized Satisfiability for Linear Temporal Logic
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used. If, in contrast, the set of propositional operators is restricted, the complexity may decrease. This p...
Gardado en:
| Principais autores: | , , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Logical Methods in Computer Science e.V.
2009-01-01
|
| Series: | Logical Methods in Computer Science |
| Assuntos: | |
| Acceso en liña: | https://lmcs.episciences.org/1158/pdf |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|