Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"Commutative semirings"”.

  1. Kleene-Type Results for Weighted Tree-Automata

    … of the Kleene-theorem to formal tree-series over commutative semirings (the Kleene theorem states the coincidence between rational and recognizable formal languages). To this end weighted tree-languages are introduced and the Kleene-theorem is proved for them. The desired result for formal …

    qucosa-diss

  2. Quantitative architecture styles

    … propositional configuration logic over a commutative semiring. This logic is able to describe software architectures with quantitative features such as the maximum (or minimum) cost, the probability or time needed of the interactions in the architecture. Given an architecture with weighted …

    greece Repository record for Quantitative architecture styles (opens in a new tab)

  3. Expressiveness and Decidability of Weighted Automata and Weighted Logics

    … true for a weighted MSO logic with arbitrary commutative semirings as weight structure. In the second part, we lift four decidability results from max-plus word automata to max-plus tree automata. Max-plus word and tree automata are weighted automata over the max-plus semiring and assign real …

    qucosa-diss

  4. Quantitative modelling of parametric component-based systems

    … first-order extended interaction logic over commutative semirings for describing the non-functional aspects of architectures and parametric architectures, respectively. Then we describe a weighted component by a pair of a component and a weighted mapping. In turn, we define a weighted …

    greece Repository record for Quantitative modelling of parametric component-based systems (opens in a new tab)