Solving linear equations in *-continuous action lattices

  • Authors:
  • Béchir Ktari;François Lajeunesse-Robert;Claude Bolduc

  • Affiliations:
  • Département d'informatique et de génie logiciel, Université Laval, Québec, Canada;Département d'informatique et de génie logiciel, Université Laval, Québec, Canada;Département d'informatique et de génie logiciel, Université Laval, Québec, Canada

  • Venue:
  • RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This work aims to investigate conditions under which program analysis can be viewed as algebraically solving equations involving terms of subclasses of Kleene algebras and variables. In this paper, we show how to solve a kind of linear equations in which variables appear only on one side of the equality sign, over a *-continuous action lattice. Furthermore, based on the method developed for solving equations, we present how model checking of a restricted version of the linear µ-calculus over finite traces can be done by algebraic manipulations. Finally, we give some ideas on how to extend the resolution method to other classes of equations and algebraic structures.