Sciweavers

500 search results - page 19 / 100
» Thread-Modular Abstraction Refinement
Sort
View
FORMATS
2010
Springer
14 years 9 months ago
Combining Symbolic Representations for Solving Timed Games
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...
Rüdiger Ehlers, Robert Mattmüller, Hans-...
IANDC
2008
114views more  IANDC 2008»
14 years 11 months ago
Generalizing the Paige-Tarjan algorithm by abstract interpretation
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...
Francesco Ranzato, Francesco Tapparo
MP
2008
61views more  MP 2008»
14 years 11 months ago
How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
Abstract By refining a variant of the Klee
Antoine Deza, Eissa Nematollahi, Tamás Terl...
76
Voted
CHARME
2003
Springer
120views Hardware» more  CHARME 2003»
15 years 3 months ago
A Compositional Theory of Refinement for Branching Time
Abstract. I develop a compositional theory of refinement for the branching time framework based on stuttering simulation and prove that if one system refines another, then a refine...
Panagiotis Manolios
CORR
2008
Springer
108views Education» more  CORR 2008»
14 years 11 months ago
Query Refinement by Multi Word Term expansions and semantic synonymy
perception of domain concepts. We have run this experiment on the 367 645 English abstracts of PASCAL 2005-2006 bibliographic database (http://www.inist.fr) and compared the struct...
Véronila Lux-Pogodalla, Eric SanJuan