384 search results - page 17 / 77 » On the Semantics of Markov Automata |
134
click to vote
FORMATS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We describe a partial order reduction technique for a realtime component model. Components are described as timed automata with data ports, which can be composed in stati...
115
click to vote
WWW
2009
ACM
15 years 8 months ago
2009
ACM
Most of the approaches for dealing with uncertainty in the Semantic Web rely on the principle that this uncertainty is already asserted. In this paper, we propose a new approach t...
107
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
130
click to vote
CIE
2009
Springer
15 years 8 months ago
2009
Springer
We present a technique to associate to stochastic programs written in stochastic Concurrent Constraint Programming a semantics in terms of a lattice of hybrid automata. The aim of ...
101
click to vote
ICST
2010
IEEE
15 years 11 days ago
2010
IEEE
Abstract—In this paper we introduce Timed Moore Automata, a specification formalism which is used in industrial train control applications for specifying the real-time behavior ...