35 search results - page 1 / 7 » Expressiveness and Closure Properties for Quantitative Langu... |
192
Voted
LICS
2009
IEEE
16 years 1 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 ...
162
Voted
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
In quantitative verification, system states/transitions have associated costs, and these are used to associate mean-payoff costs with infinite behaviors. In this paper, we propose ...
193
Voted
SDL
2001
15 years 7 months ago
2001
Abstract. We describe an approach for the verification of quantitative temporal properties of SDL specifications, which adapts techniques developed for timed automata [2]. With res...
171
Voted
FCT
2009
Springer
16 years 28 days ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
183
Voted
CONCUR
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. We consider linear time temporal logic enriched with semiextended regular expressions through various operators that have been proposed in the literature, in particular i...