Abstract
Using correspondences between linear temporal logic and modal Kleene Algebra, we prove in an algebraic manner rules of linear temporal logic involving the until operator. These can be used to verify programmable logic controllers; as a case study we use a part of the control of pedestrian lights, verified with the interactive tool KIV.
Cite
CITATION STYLE
Ertel, J., Glück, R., & Möller, B. (2018). Algebraic derivation of until rules and application to timer verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11194 LNCS, pp. 244–262). Springer Verlag. https://doi.org/10.1007/978-3-030-02149-8_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
