Weighted Automata and Weighted Logics on Infinite Words

2006 ◽  
pp. 49-58 ◽  
Author(s):  
Manfred Droste ◽  
George Rahonis
Keyword(s):  
Infinite Words ◽  
Weighted Automata ◽  
Weighted Logics

Weighted automata and weighted logics on infinite words

2010 ◽  
Vol 54 (1) ◽  
pp. 26-45 ◽  
Author(s):  
M. Droste ◽  
G. Rahonis
Keyword(s):  
Infinite Words ◽  
Weighted Automata ◽  
Weighted Logics

WEIGHTED AUTOMATA AND REGULAR EXPRESSIONS OVER VALUATION MONOIDS

2011 ◽  
Vol 22 (08) ◽  
pp. 1829-1844 ◽  
Author(s):  
MANFRED DROSTE ◽  
INGMAR MEINECKE
Keyword(s):  
Power Consumption ◽  
Average Cost ◽  
Peak Power ◽  
Regular Expressions ◽  
Infinite Words ◽  
New Class ◽  
Weighted Automata ◽  
Peak Power Consumption ◽  
Weight Structures

Quantitative aspects of systems like consumption of resources, output of goods, or reliability can be modeled by weighted automata. Recently, objectives like the average cost or the longtime peak power consumption of a system have been modeled by weighted automata which are not semiring weighted anymore. Instead, operations like limit superior, limit average, or discounting are used to determine the behavior of these automata. Here, we introduce a new class of weight structures subsuming a range of these models as well as semirings. Our main result shows that such weighted automata and Kleene-type regular expressions are expressively equivalent both for finite and infinite words.

scholarly journals Weighted automata and weighted logics with discounting

2009 ◽  
Vol 410 (37) ◽  
pp. 3481-3494 ◽  
Author(s):  
Manfred Droste ◽  
George Rahonis
Keyword(s):  
Weighted Automata ◽  
Weighted Logics

scholarly journals Minimization of Limit-Average Automata

2021 ◽  
Author(s):  
Jakub Michaliszyn ◽  
Jan Otop
Keyword(s):  
Polynomial Time ◽  
Equivalence Relation ◽  
Minimization Problem ◽  
Value Function ◽  
Equivalence Classes ◽  
Minimization Algorithm ◽  
Infinite Words ◽  
Average Value ◽  
Weighted Automata

LimAvg-automata are weighted automata over infinite words that aggregate weights along runs with the limit-average value function. In this paper, we study the minimization problem for (deterministic) LimAvg-automata. Our main contribution is an equivalence relation on words characterizing LimAvg-automata, i.e., the equivalence classes of this relation correspond to states of an equivalent LimAvg-automaton. In contrast to relations characterizing DFA, our relation depends not only on the function defined by the target automaton, but also on its structure. We show two applications of this relation. First, we present a minimization algorithm for LimAvg-automata, which returns a minimal LimAvg-automaton among those equivalent and structurally similar to the input one. Second, we present an extension of Angluin's L^*-algorithm with syntactic queries, which learns in polynomial time a LimAvg-automaton equivalent to the target one.

Integer Weighted Automata on Infinite Words

2021 ◽  
pp. 167-179
Author(s):  
Vesa Halava ◽  
Tero Harju ◽  
Reino Niskanen ◽  
Igor Potapov
Keyword(s):  
Infinite Words ◽  
Weighted Automata

scholarly journals Weighted Automata on Infinite Words in the Context of Attacker-Defender Games

2015 ◽  
pp. 206-215 ◽  
Author(s):  
Vesa Halava ◽  
Tero Harju ◽  
Reino Niskanen ◽  
Igor Potapov
Keyword(s):  
Infinite Words ◽  
Weighted Automata

scholarly journals Weighted automata and weighted logics

2007 ◽  
Vol 380 (1-2) ◽  
pp. 69-86 ◽  
Author(s):  
Manfred Droste ◽  
Paul Gastin
Keyword(s):  
Weighted Automata ◽  
Weighted Logics

scholarly journals Pebble Weighted Automata and Weighted Logics

2014 ◽  
Vol 15 (2) ◽  
pp. 1-35 ◽  
Author(s):  
Benedikt Bollig ◽  
Paul Gastin ◽  
Benjamin Monmege ◽  
Marc Zeitoun
Keyword(s):  
Weighted Automata ◽  
Weighted Logics
Sign in / Sign up

Export Citation Format

Share Document