Canonical finite models of Kleene algebra with tests

DOI10.1016/J.JLAMP.2015.11.001MaRDI QIDQ299196zbMATH OpenOpenAlexWikidataFDO

Authors Takeo Uramoto

Publication date 22 June 2016

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jlamp.2015.11.001

zbMATH Keywords

regular languagecompleteness theoremcanonical finite modelKleene algebra with testsprogram optimizationsyntactic semiring

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Decidability of theories and sets of sentences (03B25)

Recommendations

• A modified completeness theorem of KAT and decidability of term reducibility
• Deciding KAT and Hoare logic with derivatives
• On the equivalence of automata for KAT-expressions
• scientific article; zbMATH DE number 1086671
• Mathematics of Program Construction

Cites work

• scientific article; zbMATH DE number 1696821 (Why is no real title available?)
• scientific article; zbMATH DE number 3704559 (Why is no real title available?)
• scientific article; zbMATH DE number 3495598 (Why is no real title available?)
• scientific article; zbMATH DE number 1086671 (Why is no real title available?)
• scientific article; zbMATH DE number 1142324 (Why is no real title available?)
• scientific article; zbMATH DE number 1962779 (Why is no real title available?)
• scientific article; zbMATH DE number 1556014 (Why is no real title available?)
• scientific article; zbMATH DE number 2208070 (Why is no real title available?)
• A classification of rational languages by semilattice-ordered monoids.
• A coalgebraic approach to Kleene algebra with tests
• A completeness theorem for Kleene algebras and the algebra of regular events
• A modified completeness theorem of KAT and decidability of term reducibility
• Characterizations of locally testable events
• Dynamic algebras: Examples, constructions, applications
• KAT + B!
• KAT-ML: an interactive theorem prover for Kleene algebra with tests
• Kleene algebra with equations
• Mathematical Foundations of Computer Science 2004
• Netkat, semantic foundations for networks
• On Hoare logic and Kleene algebra with tests
• On finite monoids having only trivial subgroups

Cited in

(5)

• On the equivalence of automata for KAT-expressions
• Deciding synchronous Kleene algebra with derivatives
• Deciding KAT and Hoare logic with derivatives
• A modified completeness theorem of KAT and decidability of term reducibility
• Modularizing the Elimination of r=0 in Kleene Algebra

Describes a project that uses

Uses Software

• NetKAT
• KAT-ML

This page was built for publication: Canonical finite models of Kleene algebra with tests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299196)