Sciweavers

231 search results - page 8 / 47
» Concurrent Reachability Games
Sort
View
CONCUR
2006
Springer
14 years 9 days 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, ...
COMPSAC
2005
IEEE
14 years 2 months ago
Designing Controllers for Reachability
We propose a deductive method for constructing reliable reachability controllers, with application to fault-tolerant discrete systems. Designing the controller reduces to finding...
Cristina Cerschi Seceleanu
ATVA
2005
Springer
130views Hardware» more  ATVA 2005»
14 years 2 months ago
Approximate Reachability for Dead Code Elimination in Esterel
Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel extends Esterel with a noninstantaneous jump instruction (compatible with conc...
Olivier Tardieu, Stephen A. Edwards
DIGRA
2005
Springer
14 years 2 months ago
Game Engineering for a Multiprocessor Architecture
This paper explores the idea that future game consoles and computers may no longer be single processor units, but instead symmetrical multiprocessor units. If this were to occur g...
Abdennour El Rhalibi, Steve Costa, David England
LICS
2000
IEEE
14 years 29 days ago
Concurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
Luca de Alfaro, Thomas A. Henzinger