Navegación

Búsqueda

Búsqueda avanzada

Resultados de búsqueda para Temporal Logic

One-pass Context-based Tableaux Systems for CTL and ECTL

When building tableau for temporal logic formulae, applying a two-pass con- struction, we first check the validity of the given tableaux input by creating a tableau graph, and then, in the second ‘pass’, we check if all the eventualities are satisfied. In one-pass tableaux checking the validity of the input does not require these auxiliary constructions. This paper continues the development of one-pass tableau method for temporal logics introducing tree-style one-pass tableau systems for Computation Tree Logic (CTL) and shows how this can be extended to capture Extended CTL (ECTL). A distinctive feature here is the utilisation, for the core tableau construction, of the concept of a context of an eventuality which forces its earliest fulfilment. Relevant algorithms for obtain- ing a systematic tableau for these branching-time logics are also defined. We prove the soundness and completeness of the method. With these developments of a tree-shaped one-pass tableau for CTL and ECTL, we have formalisms which are well suited for the automation and are amenable for the implementation, and for the formulation of dual sequent calculi. This brings us one step closer to the application of one-pass context-based tableaux in certified model checking for a variety of CTL-type branching-time logics.

Autores: Alex Abuin / Alexander Bolotov / Montserrat Hermo / Paqui Lucio / 
Palabras Clave: branching-time - expressiveness - fairness - Temporal Logic

Invariant-Free Clausal Temporal Resolution

We provide an extended abstract of the paper with the same title and authors that is going to appear in Journal of Automated Reasoning (Online from December 2th, 2011).

Autores: J. Gaintzarain / M. Hermo / P. Lucio / M. Navarro / F. Orejas / 
Palabras Clave: Clausal Normal Form - Invariant-free - Resolution - Temporal Logic

No encuentra los resultados que busca? Prueba nuestra Búsqueda avanzada