Interpretability of first-order linear temporal logics in fork algebras

In this paper we prove theorems on the interpretability of the first-order temporal logics LTL and TL into Fork Algebras. This result is part of a research project on the interpretability of logics in Fork Algebras, and has important applications towards the relational specification of properties of...

Descripción completa

Guardado en:
Detalles Bibliográficos
Publicado: 2006
Materias:
Fork algebras
Interpretability
Software verification
Temporal logics
Computer software
Formal logic
Mathematical programming
Theorem proving
Algebra
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15678326_v66_n2_p161_Frias
http://hdl.handle.net/20.500.12110/paper_15678326_v66_n2_p161_Frias
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
Descripción
Sumario:In this paper we prove theorems on the interpretability of the first-order temporal logics LTL and TL into Fork Algebras. This result is part of a research project on the interpretability of logics in Fork Algebras, and has important applications towards the relational specification of properties of systems within the Ar gentum tool. © 2005 Elsevier Inc. All rights reserved.

Ejemplares similares