Sciweavers

4539 search results - page 684 / 908
» Approaches to Compute Workflow Complexity
Sort
View
HYBRID
2003
Springer
16 years 13 days ago
Reachability Analysis of Nonlinear Systems Using Conservative Approximation
Abstract. In this paper we present an approach to approximate reachability computation for nonlinear continuous systems. Rather than studying a complex nonlinear system ˙x = g(x),...
Eugene Asarin, Thao Dang, Antoine Girard
SAC
2010
ACM
16 years 10 days ago
An algorithm to generate the context-sensitive synchronized control flow graph
The verification of industrial systems specified with CSP often implies the analysis of many concurrent and synchronized components. The cost associated to these analyses is usu...
Marisa Llorens, Javier Oliver, Josep Silva, Salvad...
CLOUD
2010
ACM
16 years 9 days ago
The case for PIQL: a performance insightful query language
Large-scale, user-facing applications are increasingly moving from relational databases to distributed key/value stores for high-request-rate, low-latency workloads. Often, this m...
Michael Armbrust, Nick Lanham, Stephen Tu, Armando...
ECRTS
2002
IEEE
16 years 5 days ago
Fully Automatic Worst-Case Execution Time Analysis for Matlab/Simulink Models
In today’s technical world (e.g., in the automotive industry), more and more purely mechanical components get replaced by electro-mechanical ones. Thus the size and complexity o...
Raimund Kirner, Roland Lang, Gerald Freiberger, Pe...
IEEEPACT
2002
IEEE
16 years 4 days ago
Cost Effective Memory Dependence Prediction using Speculation Levels and Color Sets
Memory dependence prediction allows out-of-order issue processors to achieve high degrees of instruction level parallelism by issuing load instructions at the earliest time withou...
Soner Önder