Efficient Program Transformers for Translating LCC to PDL

Abstract This work proposes an alternative definition of the so-called program transformers, used to obtain reduction axioms in the Logic of Communication and Change. Our proposal uses an elegant matrix treatment of Brzozowski’s equational method instead of Kleene’s translation from finite automata to regular expressions. The two alternatives are shown to be equivalent, with Brzozowski’s method having the advantage of being computationally more efficient.

Authors

• Pere Pardo
• Enrique Sarrión-Morillo
• Fernando Soler-Toscano
• Fernando R. Velázquez-Quesada

Keywords

No keywords are indexed for this paper.