7311 search results - page 233 / 1463 » Time in State Machines |
174
click to vote
FORMATS
2004
Springer
16 years 18 days ago
2004
Springer
Abstract. We describe OBDD-based symbolic model checking algorithms for simply-timed systems, i.e. finite state graphs where transitions carry a duration. These durations can be a...
205
click to vote
CAV
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. This paper develops a local reasoning method to check lineartime temporal properties of concurrent programs. In practice, it is often infeasible to model check over the p...
219
click to vote
ICML
2006
IEEE
16 years 8 months ago
2006
IEEE
We propose a new model for the probabilistic estimation of continuous state variables from a sequence of observations, such as tracking the position of an object in video. This ma...
191
click to vote
ICML
2004
IEEE
16 years 8 months ago
2004
IEEE
In this paper we focus on the adaptation of boosting to grammatical inference. We aim at improving the performances of state merging algorithms in the presence of noisy data by us...
183
click to vote
ICML
2004
IEEE
16 years 8 months ago
2004
IEEE
Predictive state representations (PSRs) have recently been proposed as an alternative to partially observable Markov decision processes (POMDPs) for representing the state of a dy...