Sciweavers

1163 search results - page 114 / 233
» Concurrent Subspaces Analysis
Sort
View
160
Voted
ATVA
2006
Springer
131views Hardware» more  ATVA 2006»
15 years 7 months ago
Timed Unfoldings for Networks of Timed Automata
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...
117
Voted
CONCUR
2006
Springer
15 years 7 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
108
Voted
AIPS
2007
15 years 6 months ago
Evaluating Temporal Planning Domains
The last eight years have seen dramatic progress in temporal planning as highlighted by the temporal track in the last three International Planning Competitions (IPC). However, ou...
William Cushing, Daniel S. Weld, Subbarao Kambhamp...
133
Voted
CONCURRENCY
2010
127views more  CONCURRENCY 2010»
15 years 3 months ago
Extreme scalability challenges in micro-finite element simulations of human bone
Coupling recent imaging capabilities with microstructural finite element (microFE) analysis offers a powerful tool to determine bone stiffness and strength. It shows high potentia...
Constantine Bekas, Alessandro Curioni, Peter Arben...
112
Voted
CONCURRENCY
2008
95views more  CONCURRENCY 2008»
15 years 3 months ago
The File Mover: high-performance data transfer for the grid
The exploration in many scientific disciplines (e.g., High-Energy Physics, Climate Modeling, and Life Sciences) involves the production and the analysis of massive data collection...
Cosimo Anglano, Massimo Canonico