In any real-life identification problem, only a finite number of data points is available. On the other hand, almost all results in stochastic identification pertain to asymptotic...
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
We give logical characterizations of bisimulation relations for the probabilistic automata of Segala in terms of three Hennessy-Milner style logics. The three logics characterize s...
Traditionally, simulation is used to perform probabilistic analysis. However, it provides less accurate results and cannot handle large-scale problems due to the enormous CPU time ...
We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditi...