Sciweavers

3199 search results - page 448 / 640
» Variability in Automation System Models
Sort
View
RTS
2011
123views more  RTS 2011»
15 years 1 months ago
Feasibility analysis under fixed priority scheduling with limited preemptions
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
CONSTRAINTS
2010
153views more  CONSTRAINTS 2010»
15 years 4 months ago
Philosophy of the MiniZinc challenge
MiniZinc arose as a response to the extended discussion at CP2006 of the need for a standard modelling language for CP. This is a challenging problem, and we believe MiniZinc makes...
Peter J. Stuckey, Ralph Becket, Julien Fischer
186
Voted
DAC
2002
ACM
16 years 7 months ago
A framework for evaluating design tradeoffs in packet processing architectures
We present an analytical method to evaluate embedded network packet processor architectures, and to explore their design space. Our approach is in contrast to those based on simul...
Lothar Thiele, Matthias Gries, Samarjit Chakrabort...
LOPSTR
2009
Springer
16 years 1 months ago
Deciding Full Branching Time Logic by Program Transformation
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
EUROPAR
2007
Springer
16 years 1 months ago
Negotiation Strategies Considering Opportunity Functions for Grid Scheduling
In Grid systems, nontrivial qualities of service have to be provided to users by the resource providers. However, resource management in a decentralized infrastructure is a complex...
Jiadao Li, Kwang Mong Sim, Ramin Yahyapour