Results 1  10
of
132,213
MeanPayoff Automaton Expressions ⋆
"... Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Meanpayoff automata are finite automata with numerical weights on transitions that assign to each infinite path the longrun average of the transition weights. When the mode of branching o ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
, as the quantitative generalization of the problems of universality and language inclusion is undecidable. We introduce a new class of quantitative languages, defined by meanpayoff automaton expressions, which is robust and decidable: it is closed under the four pointwise operations, and we show that all decision
Meanpayoff games and propositional proofs
, 2010
"... We associate a CNFformula to every instance of the meanpayoff game problem in such a way that if the value of the game is nonnegative the formula is satisfiable, and if the value of the game is negative the formula has a polynomialsize refutation in Σ2Frege (a.k.a. DNFresolution). This reduces ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We associate a CNFformula to every instance of the meanpayoff game problem in such a way that if the value of the game is nonnegative the formula is satisfiable, and if the value of the game is negative the formula has a polynomialsize refutation in Σ2Frege (a.k.a. DNFresolution). This reduces
Synthesis from ltl specifications with meanpayoff objectives
 In TACAS
, 2013
"... Abstract. The classical LTL synthesis problem is purely qualitative: the given LTL specification is realized or not by a reactive system. LTL is not expressive enough to formalize the correctness of reactive systems with respect to some quantitative aspects. This paper extends the qualitative LTL s ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
synthesis setting to a quantitative setting. The alphabet of actions is extended with a weight function ranging over the rational numbers. The value of an infinite word is the meanpayoff of the weights of its letters. The synthesis problem then amounts to automatically construct (if possible) a reactive
Meanpayoff parity games
 PROC. OF LICS, IEEE COMPUTER SOCIETY
"... Energy parity games are infinite twoplayer turnbased games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of energy in the game) must remain positive. Beside their own i ..."
Abstract

Cited by 64 (12 self)
 Add to MetaCart
equivalent to the problem of deciding the winner in meanpayoff parity games, which can thus be solved in NP ∩ coNP. As a consequence we also obtain a conceptually simple algorithm to solve meanpayoff parity games.
The Theory of Hybrid Automata
, 1996
"... A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied on pur ..."
Abstract

Cited by 680 (13 self)
 Add to MetaCart
A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied
Generalized meanpayoff and energy games
 CoRR
"... In meanpayoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Generalized meanpayoff and energy games replace in ..."
Abstract

Cited by 47 (11 self)
 Add to MetaCart
In meanpayoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Generalized meanpayoff and energy games replace
Measuring Permissiveness in Parity Games: MeanPayoff Parity Games Revisited
, 2011
"... We study nondeterministic strategies in parity games with the aim of computing a most permissive winning strategy. Following earlier work, we measure permissiveness in terms of the average number/weight of transitions blocked by a strategy. Using a translation into meanpayoff parity games, we prov ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We study nondeterministic strategies in parity games with the aim of computing a most permissive winning strategy. Following earlier work, we measure permissiveness in terms of the average number/weight of transitions blocked by a strategy. Using a translation into meanpayoff parity games, we
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 574 (50 self)
 Add to MetaCart
, many standard program properties, such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does
Modeling and simulation of genetic regulatory systems: A literature review
 JOURNAL OF COMPUTATIONAL BIOLOGY
, 2002
"... In order to understand the functioning of organisms on the molecular level, we need to know which genes are expressed, when and where in the organism, and to which extent. The regulation of gene expression is achieved through genetic regulatory systems structured by networks of interactions between ..."
Abstract

Cited by 729 (15 self)
 Add to MetaCart
In order to understand the functioning of organisms on the molecular level, we need to know which genes are expressed, when and where in the organism, and to which extent. The regulation of gene expression is achieved through genetic regulatory systems structured by networks of interactions between
Results 1  10
of
132,213