Tableaux and model checking for memory logics

Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then extended with a collection of operations to access and modify the data structure. In this paper we study their satisfiab...

Descripción completa

Detalles Bibliográficos
Publicado:	2009
Materias:	Logical language Modal language Modal logic Model checking problem Relational Model Satisfiability Satisfiability problems Sublanguages Automata theory Biomineralization Data structures Linguistics Problem solving Model checking
Acceso en línea:	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v5607LNAI_n_p47_Areces http://hdl.handle.net/20.500.12110/paper_03029743_v5607LNAI_n_p47_Areces
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	paper:paper_03029743_v5607LNAI_n_p47_Areces
record_format	dspace
spelling	paper:paper_03029743_v5607LNAI_n_p47_Areces2023-06-08T15:28:31Z Tableaux and model checking for memory logics Logical language Modal language Modal logic Model checking problem Relational Model Satisfiability Satisfiability problems Sublanguages Automata theory Biomineralization Data structures Linguistics Problem solving Model checking Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then extended with a collection of operations to access and modify the data structure. In this paper we study their satisfiability and the model checking problems. We first give sound and complete tableaux calculi for the memory logic MLΚ,®, (the basic modal language extended with the operator ® used to memorize a state, the operator used to wipe out the memory, and the operator Kappa; used to check if the current point of evaluation is memorized) and some of its sublanguages. As the satisfiability problem of (MLΚ,®,) is undecidable, the tableau calculus we present is non terminating. Hence, we furthermore study a variation that ensures termination, at the expense of completeness, and we use model checking to ensure soundness. Secondly, we show that the model checking problem is PSpace-complete. © 2009 Springer-Verlag Berlin Heidelberg. 2009 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v5607LNAI_n_p47_Areces http://hdl.handle.net/20.500.12110/paper_03029743_v5607LNAI_n_p47_Areces
institution	Universidad de Buenos Aires
institution_str	I-28
repository_str	R-134
collection	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic	Logical language Modal language Modal logic Model checking problem Relational Model Satisfiability Satisfiability problems Sublanguages Automata theory Biomineralization Data structures Linguistics Problem solving Model checking
spellingShingle	Logical language Modal language Modal logic Model checking problem Relational Model Satisfiability Satisfiability problems Sublanguages Automata theory Biomineralization Data structures Linguistics Problem solving Model checking Tableaux and model checking for memory logics
topic_facet	Logical language Modal language Modal logic Model checking problem Relational Model Satisfiability Satisfiability problems Sublanguages Automata theory Biomineralization Data structures Linguistics Problem solving Model checking
description	Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then extended with a collection of operations to access and modify the data structure. In this paper we study their satisfiability and the model checking problems. We first give sound and complete tableaux calculi for the memory logic MLΚ,®, (the basic modal language extended with the operator ® used to memorize a state, the operator used to wipe out the memory, and the operator Kappa; used to check if the current point of evaluation is memorized) and some of its sublanguages. As the satisfiability problem of (MLΚ,®,) is undecidable, the tableau calculus we present is non terminating. Hence, we furthermore study a variation that ensures termination, at the expense of completeness, and we use model checking to ensure soundness. Secondly, we show that the model checking problem is PSpace-complete. © 2009 Springer-Verlag Berlin Heidelberg.
title	Tableaux and model checking for memory logics
title_short	Tableaux and model checking for memory logics
title_full	Tableaux and model checking for memory logics
title_fullStr	Tableaux and model checking for memory logics
title_full_unstemmed	Tableaux and model checking for memory logics
title_sort	tableaux and model checking for memory logics
publishDate	2009
url	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v5607LNAI_n_p47_Areces http://hdl.handle.net/20.500.12110/paper_03029743_v5607LNAI_n_p47_Areces
_version_	1768544223981731840

Tableaux and model checking for memory logics

Ejemplares similares