A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
A non-probabilistic relational model of probabilistic Kleene algebras
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
Towards automated proof support for probabilistic distributed systems
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
*-Continuous Idempotent Left Semirings and Their Ideal Completion
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Relational and multirelational representation theorems for complete idempotent left semirings
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Hi-index | 0.00 |
We refine and extend the known results that the set of ordinary binary relations forms a Kleene algebra, the set of up-closed multirelations forms a lazy Kleene algebra, the set of up-closed finite multirelations forms a monodic tree Kleene algebra, and the set of total up-closed finite multirelations forms a probabilistic Kleene algebra. For the refinement, we introduce a notion of type of multirelations. For each of eight classes of relaxation of Kleene algebra, we give a sufficient condition on type T so that the set of up-closed multirelations of T belongs to the class. Some of the conditions are not only sufficient, but also necessary.