Results 1 
4 of
4
Probabilistic and Topological Semantics for Timed Automata
"... Like most models used in modelchecking, timed automata are an idealized mathematical model used for representing systems with strong timing requirements. In such mathematical models, properties can be violated, due to unlikely (sequences of) events. We propose two new semantics for the satisfactio ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Like most models used in modelchecking, timed automata are an idealized mathematical model used for representing systems with strong timing requirements. In such mathematical models, properties can be violated, due to unlikely (sequences of) events. We propose two new semantics for the satisfaction of LTL formulas, one based on probabilities, and the other one based on topology, to rule out these sequences. We prove that the two semantics are equivalent and lead to a PSPACEComplete modelchecking problem for LTL over finite executions.
BanachMazur Games on Graphs
, 2008
"... We survey determinacy, definability, and complexity issues of BanachMazur games on finite and infinite graphs. Infinite games where two players take turns to move a token through a directed graph, thus tracing outaninfinitepath, havenumerousapplicationsindifferentbranchesofmathematics andcomputer s ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We survey determinacy, definability, and complexity issues of BanachMazur games on finite and infinite graphs. Infinite games where two players take turns to move a token through a directed graph, thus tracing outaninfinitepath, havenumerousapplicationsindifferentbranchesofmathematics andcomputer science. In the usual format, the possible moves of the players are given by the edges of the graph; in each move a player takes the token from its current position along an edge to a next position. In BanachMazur games the players instead select in each move a path of arbitrary finite length rather thanjustanedge. Inbothcasestheoutcomeofaplayisaninfinitepath. Awinningconditionisthus given by a set of infinite paths which is often specified by a logical formula, for instance from S1S, LTL, or firstorder logic. BanachMazur gameshavealongtraditionindescriptivesettheoryandtopology, andtheyhaverecentlybeenshowntohaveinterestingapplications alsoincomputerscience,forinstanceforplanning in nondeterministic domains, for the study of fairness in concurrent systems, and for the semantics of timed automata. It turns out that BanachMazur games behave quite differently than the usual graph games. Often they admit simpler winning strategies and more efficient algorithmic solutions. For instance,
On Fairness and Randomness
"... We investigate the relation between the behavior of nondeterministic systems under fairness constraints, and the behavior of probabilistic systems. To this end, first a framework based on computable stopping strategies is developed that provides a common foundation for describing both fair and prob ..."
Abstract
 Add to MetaCart
We investigate the relation between the behavior of nondeterministic systems under fairness constraints, and the behavior of probabilistic systems. To this end, first a framework based on computable stopping strategies is developed that provides a common foundation for describing both fair and probabilistic behavior. On the basis of stopping strategies it is then shown that fair behavior corresponds in a precise sense to random behavior in the sense of MartinLöf’s definition of randomness. nondeterministic systems. Under this perspective the question is investigated what probabilistic properties are needed in such an implementation to guarantee (with probability one) certain required fairness properties in the behavior of the probabilistic system. Generalizing earlier concepts of ɛbounded transition probabilities, we introduce the notion of divergent probabilistic systems, which enables an exact characterization of the fairness properties of a probabilistic implementation. Looking beyond pure fairness properties, we also investigate what other qualitative system properties are guaranteed by probabilistic implementations of fair nondeterministic behavior. This leads to a completeness result which generalizes a wellknown theorem by Pnueli and Zuck.
BanachMazur Games with Simple Winning Strategies
"... We discuss several notions of ‘simple ’ winning strategies for BanachMazur games on graphs, such as positional strategies, movecounting or lengthcounting strategies, and strategies with a memory based on finite appearance records (FAR). We investigate classes of BanachMazur games that are determ ..."
Abstract
 Add to MetaCart
We discuss several notions of ‘simple ’ winning strategies for BanachMazur games on graphs, such as positional strategies, movecounting or lengthcounting strategies, and strategies with a memory based on finite appearance records (FAR). We investigate classes of BanachMazur games that are determined via these kinds of winning strategies. BanachMazur games admit stronger determinacy results than classical graph games. For instance, all BanachMazur games with ωregular winning conditions are positionally determined. Beyond the ωregular winning conditions, we focus here on Muller conditions with infinitely many colours. We investigate the infinitary Muller conditions that guarantee positional determinacy for BanachMazur games. Further, we determine classes of such conditions that require infinite memory but guarantee determinacy via movecounting strategies, lengthcounting strategies, and FARstrategies. We also discuss the relationships between these different notions of determinacy.