503 search results - page 35 / 101 » Probabilistic Weighted Automata |
134
click to vote
CONCUR
2001
Springer
15 years 7 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
150
click to vote
COMMA
2010
14 years 10 months ago
2010
Abstract. We propose an argumentation framework for modelling jury-based dispute resolution where the dispute parties present their arguments before a judge and a jury. While the j...
157
click to vote
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...
137
click to vote
FORMATS
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we study timed games played on weighted timed automata. In this context, the reachability problem asks if, given a set T of locations and a cost C, Player 1 has a st...
STACS
2004
Springer
15 years 8 months ago
2004
Springer
d Abstract)⋆⋆ Daniel Kirsten LIAFA, Universit´e Denis Diderot – Case 7014, 2 place Jussieu, F-75251 Paris Cedex 05, France We give a positive solution to the so-called fini...