21 search results - page 3 / 5 » Weighted Automata and Weighted Logics with Discounting |
DLT
2009
13 years 3 months ago
2009
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
TCS
2010
13 years 1 days ago
2010
A text is a word together with an additional linear order on it. We study quantitative models for texts, i.e. text series which assign to texts elements of a semiring. We introduc...
LICS
2009
IEEE
13 years 12 months ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
TACAS
2004
Springer
13 years 10 months ago
2004
Springer
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, tempor...