503 search results - page 3 / 101 » Probabilistic Weighted Automata |
FORMATS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the c...
CAV
2010
Springer
13 years 10 months ago
2010
Springer
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
IPL
2007
13 years 7 months ago
2007
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
FORMATS
2004
Springer
14 years 26 days ago
2004
Springer
We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with co...
ALT
2005
Springer
14 years 4 months ago
2005
Springer
Efficient learnability using the state merging algorithm is known for a subclass of probabilistic automata termed µ-distinguishable. In this paper, we prove that state merging alg...