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

Conjuction

POINT

canvass

倒轉(zhuǎn)

enfeeble

paltry

Compatibility of Refining and Controlling Plant Automata with Bisimulation Quotients,tients. Refinement means that arbitrary transitions may be removed whereas control allows only removing edges with the same edge label. The goal is to ensure given LTL properties in the resulting plant automaton. We give a hardness result for refinement and control and investigate, in particular, th

復(fù)習(xí)

,Dependences Between Domain Constructions in?Heterogeneous Relation Algebras,ubsets exist and objects are comparable, then all sums exist. If all sums exist and atoms are rectangular, then all products exist. If all atoms are rectangular, then all subsets exist if and only if all quotients exist. We give models with rectangular atoms which rule out further dependences betwee

Cabg318

,Normal Forms for?Elements of?the?,-continuous Kleene Algebras ,the fixed-point closure of .: the centralizer of . in .. As a next step, establishing a calculus for context-free expressions, we prove a representation of elements of . by automata à la Kleene and refine it by normal form theorems that restrict the occurrences of brackets on paths through the autom

Little

漂白

,Completeness and?the?Finite Model Property for?Kleene Algebra, Reconsidered,d in the language model of KA follows from the axioms of KA. Also of interest is the . (FMP), which says that false equivalences always have a finite counterexample. Palka (2005) showed that, for KA, the FMP is equivalent to completeness..We provide a unified and elementary proof of both properties.