792 research outputs found
Kleene Algebras and Semimodules for Energy Problems
With the purpose of unifying a number of approaches to energy problems found
in the literature, we introduce generalized energy automata. These are finite
automata whose edges are labeled with energy functions that define how energy
levels evolve during transitions. Uncovering a close connection between energy
problems and reachability and B\"uchi acceptance for semiring-weighted
automata, we show that these generalized energy problems are decidable. We also
provide complexity results for important special cases
Non-Zero Sum Games for Reactive Synthesis
In this invited contribution, we summarize new solution concepts useful for
the synthesis of reactive systems that we have introduced in several recent
publications. These solution concepts are developed in the context of non-zero
sum games played on graphs. They are part of the contributions obtained in the
inVEST project funded by the European Research Council.Comment: LATA'16 invited pape
Quantitative games with interval objectives
Traditionally quantitative games such as mean-payoff games and discount sum
games have two players -- one trying to maximize the payoff, the other trying
to minimize it. The associated decision problem, "Can Eve (the maximizer)
achieve, for example, a positive payoff?" can be thought of as one player
trying to attain a payoff in the interval . In this paper we
consider the more general problem of determining if a player can attain a
payoff in a finite union of arbitrary intervals for various payoff functions
(liminf, mean-payoff, discount sum, total sum). In particular this includes the
interesting exact-value problem, "Can Eve achieve a payoff of exactly (e.g.)
0?"Comment: Full version of CONCUR submissio
26. Theorietag Automaten und Formale Sprachen 23. Jahrestagung Logik in der Informatik: Tagungsband
Der Theorietag ist die Jahrestagung der Fachgruppe Automaten und Formale Sprachen der Gesellschaft für Informatik und fand erstmals 1991 in Magdeburg statt. Seit dem Jahr 1996 wird der Theorietag von einem eintägigen Workshop mit eingeladenen Vorträgen begleitet. Die Jahrestagung der Fachgruppe Logik in der Informatik der Gesellschaft für Informatik fand erstmals 1993 in Leipzig statt. Im Laufe beider Jahrestagungen finden auch die jährliche Fachgruppensitzungen statt. In diesem Jahr wird der Theorietag der Fachgruppe Automaten und Formale Sprachen erstmalig zusammen mit der Jahrestagung der Fachgruppe Logik in der Informatik abgehalten. Organisiert wurde die gemeinsame Veranstaltung von der Arbeitsgruppe Zuverlässige Systeme des Instituts für Informatik an der Christian-Albrechts-Universität Kiel vom 4. bis 7. Oktober im Tagungshotel Tannenfelde bei Neumünster. Während des Tre↵ens wird ein Workshop für alle Interessierten statt finden. In Tannenfelde werden • Christoph Löding (Aachen) • Tomás Masopust (Dresden) • Henning Schnoor (Kiel) • Nicole Schweikardt (Berlin) • Georg Zetzsche (Paris) eingeladene Vorträge zu ihrer aktuellen Arbeit halten. Darüber hinaus werden 26 Vorträge von Teilnehmern und Teilnehmerinnen gehalten, 17 auf dem Theorietag Automaten und formale Sprachen und neun auf der Jahrestagung Logik in der Informatik. Der vorliegende Band enthält Kurzfassungen aller Beiträge. Wir danken der Gesellschaft für Informatik, der Christian-Albrechts-Universität zu Kiel und dem Tagungshotel Tannenfelde für die Unterstützung dieses Theorietags. Ein besonderer Dank geht an das Organisationsteam: Maike Bradler, Philipp Sieweck, Joel Day. Kiel, Oktober 2016 Florin Manea, Dirk Nowotka und Thomas Wilk
Weak Mso with the Unbounding Quantifier
A new class of languages of infinite words is introduced, called the
max-regular languages, extending the class of -regular languages. The
class has two equivalent descriptions: in terms of automata (a type of
deterministic counter automaton), and in terms of logic (weak monadic
second-order logic with a bounding quantifier). Effective translations between
the logic and automata are given
Revisiting Synthesis for One-Counter Automata
We study the (parameter) synthesis problem for one-counter automata with
parameters. One-counter automata are obtained by extending classical
finite-state automata with a counter whose value can range over non-negative
integers and be tested for zero. The updates and tests applicable to the
counter can further be made parametric by introducing a set of integer-valued
variables called parameters. The synthesis problem for such automata asks
whether there exists a valuation of the parameters such that all infinite runs
of the automaton satisfy some omega-regular property. Lechner showed that (the
complement of) the problem can be encoded in a restricted one-alternation
fragment of Presburger arithmetic with divisibility. In this work (i) we argue
that said fragment, called AERPADPLUS, is unfortunately undecidable.
Nevertheless, by a careful re-encoding of the problem into a decidable
restriction of AERPADPLUS, (ii) we prove that the synthesis problem is
decidable in general and in N2EXP for several fixed omega-regular properties.
Finally, (iii) we give a polynomial-space algorithm for the special case of the
problem where parameters can only be used in tests, and not updates, of the
counter
Energy Parity Games
Energy parity games are infinite two-player turn-based 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
interest in the design and synthesis of resource-constrained omega-regular
specifications, energy parity games provide one of the simplest model of games
with combined qualitative and quantitative objective. Our main results are as
follows: (a) exponential memory is necessary and sufficient for winning
strategies in energy parity games; (b) the problem of deciding the winner in
energy parity games can be solved in NP \cap coNP; and (c) we give an algorithm
to solve energy parity by reduction to energy games. We also show that the
problem of deciding the winner in energy parity games is polynomially
equivalent to the problem of deciding the winner in mean-payoff parity games,
while optimal strategies may require infinite memory in mean-payoff parity
games. As a consequence we obtain a conceptually simple algorithm to solve
mean-payoff parity games
- …