A Decision Algorithm for Full Propositional Temporal Logic
|
Descargar SCORM
Este recurso ha sido solicitado 1 veces (0 veces en los últimos 31 días).
Para poder solicitar este recurso debe identificarse como usuario de la biblioteca
|
| |
Ver
Detalles del recurso
|
|
|
A Decision Algorithm for Full Propositional Temporal Logic
|
| Id. |
46667484 |
| Idioma |
inglés
|
| Titulo |
A Decision Algorithm for Full Propositional Temporal Logic |
| Autor(es) |
Y. Kesten
Zohar Manna
Z. Manna
Amir Pnueli
H. Mcguire
A. Pnueli
|
| Localización |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.298
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
The paper presents an efficient algorithm for checking the satisfiability of a propositional linear time temporal logic formula, which may have past as well as future operators. This algorithm can be used to check validity of such formulas over all models as well as over computations of a finite-state program (model checking). Unlike previous theoretical presentations of a decision method for checking satisfiability or validity, whose first step is to construct the full set of all possible atoms of a tableau (satisfaction graph) and immediately pay the worst case exponential complexity price, the algorithm presented here builds the tableau incrementally. This means that the algorithm constructs only those atoms that are reachable from a possible initial atom, satisfying the formula to be checked. While incremental tableau construction for the future fragment of linear time temporal logic can be done in a single pass, the presence of past operators requires multiple passes that succes...
|
| Tipo |
application/postscript
|
| Palabras clave |
temporal logic
|
| Tipo de recurso |
Texto Narrativo
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
|
Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Formatos |
application/postscript
|
| Requerimientos técnicos |
Browser: Any
|
| Relación |
[IsBasedOn] ftp://ftp.wisdom.weizmann.ac.il/pub/amir/decide-full-ptl.ps.gz
[References] 10.1.1.29.454
[References] 10.1.1.23.4831
[References] 10.1.1.33.4558
[References] 10.1.1.49.2601
[References] 10.1.1.101.6414
[References] 10.1.1.106.1046
[References] 10.1.1.25.209
[References] 10.1.1.142.16
[References] 10.1.1.49.4541
[References] 10.1.1.100.9551
[References] 10.1.1.4.5047
[References] 10.1.1.30.177
[References] 10.1.1.77.2325
[References] 10.1.1.100.4081
[References] 10.1.1.101.7756
[References] 10.1.1.48.9497
[References] 10.1.1.100.3350
[References] 10.1.1.57.3704
[References] 10.1.1.23.3335
[References] 10.1.1.50.952
[References] 10.1.1.51.5785
[References] 10.1.1.52.1095
[References] 10.1.1.52.3530
[References] 10.1.1.56.7709
[References] 10.1.1.6.8973
[References] 10.1.1.63.468
[References] 10.1.1.64.4636
[References] 10.1.1.8.6213
[References] 10.1.1.86.7485
[References] 10.1.1.86.8030
[References] 10.1.1.73.1808
[References] 10.1.1.96.941
[References] 10.1.1.98.832
[References] 10.1.1.119.9494
[References] 10.1.1.49.7413
[References] 10.1.1.3.8545
[References] 10.1.1.38.9953
[References] 10.1.1.38.9181
[References] 10.1.1.30.3167
|
| Fecha de contribución |
04-ago-2009 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
