Sciweavers

14382 search results - page 430 / 2877
» Time in Connectionist Models
Sort
View
FM
2001
Springer
108views Formal Methods» more  FM 2001»
15 years 11 months ago
Improvements in BDD-Based Reachability Analysis of Timed Automata
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer
IPPS
1999
IEEE
15 years 11 months ago
Distributed, Scalable, Dependable Real-Time Systems: Middleware Services and Applications
Some classes of real-time systems function in environments which cannot be modeled with static approaches. In such environments, the arrival rates of events which drive transient ...
Lonnie R. Welch, Binoy Ravindran, Paul V. Werme, M...
RTCSA
1999
IEEE
15 years 11 months ago
Bandwidth Reservation for Real Time Traffic in Wireless Mobile Environment
This study proposes a new bandwidth reservation strategy (Two Level Guarantee) in wireless environment based on the user mobility specification which is assumed to be given at cal...
Byung-Kyu Choi, Riccardo Bettati
RTSS
1999
IEEE
15 years 11 months ago
Optimal Reward-Based Scheduling of Periodic Real-Time Tasks
Reward-based scheduling refers to the problem in which there is a reward associated with the execution of a task. In our framework, each real-time task comprises a mandatory and a...
Hakan Aydin, Rami G. Melhem, Daniel Mossé, ...
ISORC
1998
IEEE
15 years 11 months ago
The Time-Triggered Architecture
The Time-Triggered Architecture (TTA) provides a computing infrastructure for the design and implementation of dependable distributed embedded systems. A large real-time applicatio...
Hermann Kopetz