384 search results - page 2 / 77 » On the Semantics of Markov Automata |
TSMC
2008
13 years 5 months ago
2008
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is tha...
IJFCS
2008
13 years 5 months ago
2008
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...
ECBS
2009
IEEE
14 years 10 days ago
2009
IEEE
Probabilistic models are useful for analyzing systems which operate under the presence of uncertainty. In this paper, we present a technique for verifying safety and liveness prop...
LICS
2009
IEEE
14 years 5 days ago
2009
IEEE
FORMATS
2004
Springer
13 years 11 months ago
2004
Springer
In a former paper, we defined a new semantics for timed automata, the Almost ASAP semantics, which is parameterized by ∆ to cope with the reaction delay of the controller. We sh...