20126 search results - page 20 / 4026 » Timed Transition Systems |
FORMATS
2004
Springer
15 years 5 months 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...
107
Voted
PFE
2001
Springer
15 years 4 months ago
2001
Springer
Although software mass customization offers the potential for order-of-magnitude improvements in software engineering performance, the up-front cost, level of effort, assumed risk,...
110
click to vote
IJCAI
2001
15 years 1 months ago
2001
This paper presents an efficient online mode estimation algorithm for a class of sensor-rich, distributed embedded systems, the so-called hybrid systems. A central problem in dist...
ICRA
2000
IEEE
15 years 4 months ago
2000
IEEE
In this paper we deal with the problem of allocating a given number of tokens, so as to maximize the firing rate of a cyclic event graph with deterministic transition firing delay...
NAACL
2003
15 years 1 months ago
2003
It is well known that frame independence assumption is a fundamental limitation of current HMM based speech recognition systems. By treating each speech frame independently, HMMs ...