Jipsen, P.: Computer-aided investigations of relation algebras. PhD thesis, Van- derbilt University (1992) 25. Jipsen, P., Luk ́acs, E.: Representability of finite simple relation algebras with many identity atoms.
At first, when we defined DAD (see [3,4]), our goal was to get as close as possible to the kind of algebras that one gets by defining demonic operators in Kleene algebra with domain (KAD), as is done in [8,9], and then forgetting the ...
9th International Conference on Relational Methods in Computer Science and 4th International Workshop on Applications ... a little reflection shows for all Y,Z ∈ S the equivalence of Y ⊆ Z and STS Y,Z. Therefore, STS : S ↔ S is the ...
In the following, we show how relation algebra and RelView can be used for solving problems on simple games. For it, we use a definition via the set of winning coalitions. Definition 3.1. A simple game is a pair (N,W), where N = {1,2 ...
Consequently, omega is not tame in A23, since ∇a is undefined here, and in A33. ... In all four finite i-semirings, omega is benign. ... However, since the omega operator is related to finite behaviour in all these models (cf.
The book constitutes the joint refereed proceedings of the 11th International Conference on Relational Methods in Computer Science, RelMiCS 2009, and the 6th International Conference on Applications of Kleene Algebras, AKA 2009, held in ...
Relations and Kleene Algebra in Computer Science