Titlebook: Relational and Algebraic Methods in Computer Science; 20th International C Roland Glück,Luigi Santocanale,Michael Winter Conference proceed

HOWL

畫布

,Implication Algebras and?Implication Semigroups of?Binary Relations,oblems decidable here). We show that this also holds in the context of unary (and binary) relations and present a Stone-style representation theorem. We then show that the (finite) representation decision problem is undecidable for implication semigroups, in stark contrast with implication algebras.

Psychogenic

,On the?Complexity of?Kleene Algebra with?Domain,tization of program equations valid in relational test algebra. We also show that the equational theory of Kleene algebra with domain coincides with the equational theory of *-continuous Kleene algebra with domain.

祖?zhèn)?/a>

兒童

災(zāi)難

Relational Algebraic Approach to the Real Numbers the Additive Group,on of a relation power, i.e., an abstract version of power sets within the category. This allows us to utilize a relation algebraic version of Tarski’s axioms of the real numbers as a first-order definition of a real number object. The current paper focuses on the addition operation of the real numb

CAGE

Compatibility of Refining and Controlling Plant Automata with Bisimulation Quotients, ensure given LTL properties in the resulting plant automaton. We give a hardness result for refinement and control and investigate, in particular, the question whether refineability and controllability can be decided by looking at bisimulation quotients.

Clumsy

Relational Algebraic Approach to the Real Numbers the Additive Group,s axioms of the real numbers as a first-order definition of a real number object. The current paper focuses on the addition operation of the real number object. It is shown that addition forms a densely and linearly ordered abelian group.