®®®® SIIA Público

Título del libro: Proceedings - 2019 7th International Conference In Software Engineering Research And Innovation, Conisoft 2019
Título del capítulo: A Satisfiability Algorithm for the Mu-Calculus for Trees with Presburger Constraints

Autores UNAM:
ISMAEL EVERARDO BARCENAS PATIÃ?O; GUILLERMO GILBERTO MOLERO CASTILLO; ALEJANDRO VELAZQUEZ MENA;
Autores externos:

Idioma:

Año de publicación:
2019
Palabras clave:

Calculations; Digital arithmetic; Engineering research; Forestry; Formal languages; Software engineering; Temporal logic; Arithmetic expression; Breadth-first search; Fixed point operator; Labeled transition systems; Modal logic; Presburger arithmetic; Recursive property; Satisfiability algorithms; Trees (mathematics)


Resumen:

The µ-calculus is an expressive modal logic with fixed-point operators, well-known as a formal language to specify and verify labeled transition systems. We describe a satisfiability algorithm for the µ-calculus interpreted on tree models and extended with converse modalities and Presburger arithmetic operators. Converse modalities, together with the fixed-point operators, can be used to specify multi-directional and recursive properties in tree models. Presburger operators constrain the number of children nodes on tree models with respect to arithmetic expressions. The algorithm is based on a breadth-first search in a Fischer-Lardner construction of tree models. We also describe an implementation of the algorithm and report several experiments. © 2019 IEEE.


Entidades citadas de la UNAM: