Sciweavers

17840 search results - page 3327 / 3568
» Heterogeneous Parallel Computing
Sort
View
CONCUR
2007
Springer
16 years 21 days ago
Pushdown Module Checking with Imperfect Information
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...
Benjamin Aminof, Aniello Murano, Moshe Y. Vardi
CONCUR
2007
Springer
16 years 21 days ago
Making Random Choices Invisible to the Scheduler
Abstract. When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to res...
Konstantinos Chatzikokolakis, Catuscia Palamidessi
CONCUR
2007
Springer
16 years 21 days ago
Causal Message Sequence Charts
Scenario languages based on Message Sequence Charts (MSCs) have been widely studied in the last decade [21,20,3,15,12,19,14]. The high expressive power of MSCs renders many basic ...
Thomas Gazagnaire, Blaise Genest, Loïc H&eacu...
CONCUR
2007
Springer
16 years 21 days ago
Timed Concurrent Game Structures
Abstract. We propose a new model for timed games, based on concurrent game structures (CGSs). Compared to the classical timed game automata of Asarin et al. [8], our timed CGSs are...
Thomas Brihaye, François Laroussinie, Nicol...
CONCUR
2007
Springer
16 years 21 days ago
Asynchronous Games: Innocence Without Alternation
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
Paul-André Melliès, Samuel Mimram
« Prev « First page 3327 / 3568 Last » Next »