A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
ACM Transactions on Programming Languages and Systems (TOPLAS)
On Hoare logic and Kleene algebra with tests
ACM Transactions on Computational Logic (TOCL)
Dynamic Algebras which are not Kripke Structures
MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
A Representation Theorem for Models of *-Free PDL
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Certification of Compiler Optimizations Using Kleene Algebra with Tests
CL '00 Proceedings of the First International Conference on Computational Logic
Kleene Algebra with Tests: Completeness and Decidability
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
On the Duality of Dynamic Algebras and Kripke Models
Logic of Programs, Workshop
Substructural logic and partial correctness
ACM Transactions on Computational Logic (TOCL)
On the complexity of reasoning in Kleene algebra
Information and Computation - Special issue: LICS'97
The Complexity of Kleene Algebra with Tests
The Complexity of Kleene Algebra with Tests
Kleene Algebra with Tests and Program Schematology
Kleene Algebra with Tests and Program Schematology
The horn theory of relational kleene algebra
The horn theory of relational kleene algebra
| Hi-index | 0.00 |
We investigate conditions under which a given Kleene algebra with tests is isomorphic to an algebra of binary relations. Two simple separation properties are identified that, along with star-continuity, are sufficient for nonstandard relational representation. An algebraic condition is identified that is necessary and sufficient for the construction to produce a standard representation.