Sciweavers

14360 search results - page 423 / 2872
» Time Modeling in MARTE
Sort
View
ICLP
2003
Springer
15 years 9 months ago
Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...
Frank D. Valencia
FM
2001
Springer
108views Formal Methods» more  FM 2001»
15 years 9 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 9 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 9 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 9 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é, ...