Counting LTLReportar como inadecuado




Counting LTL - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 LIAFA - Laboratoire d-informatique Algorithmique : Fondements et Applications 2 LIGM - Laboratoire d-Informatique Gaspard-Monge

Abstract : This paper presents a quantitative extension for the linear-time temporal logic LTL allowing to specify the number of states satisfying certain sub-formulas along paths. We give decision procedures for the satisfiability and model checking of this new temporal logic and study the complexity of the corresponding problems. Furthermore we show that the problems become undecidable when more expressive constraints are considered.

Keywords : temporal logic ltl expressiveness model-checking satisfiability





Autor: François Laroussinie - Antoine Meyer - Eudes Petonnet -

Fuente: https://hal.archives-ouvertes.fr/



DESCARGAR PDF




Documentos relacionados