7311 search results - page 282 / 1463 » Time in State Machines |
146
click to vote
FMSD
2008
15 years 7 months ago
2008
Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks. The traditional semantics is not robust because the slightest perturb...
235
click to vote
ASPLOS
1996
ACM
15 years 11 months ago
1996
ACM
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
209
click to vote
ICTAC
2005
Springer
16 years 24 days ago
2005
Springer
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
205
click to vote
DAC
1996
ACM
15 years 11 months ago
1996
ACM
-- This paper presents an efficient method for the timing verification of concurrent systems, modeled as labeled Timed Petri nets. The verification problems we consider require us ...
190
click to vote
EOR
2006
15 years 7 months ago
2006
In this paper, we present a stochastic model for the dynamic fleet management problem with random travel times. Our approach decomposes the problem into time-staged subproblems by...