Results 11 to 20 of about 6,380 (117)
Visibly Pushdown Modular Games [PDF]
, 2014 Games on recursive game graphs can be used to reason about the control flow of sequential programs with recursion. In games over recursive game graphs, the most natural notion of strategy is the modular strategy, i.e., a strategy that is local to a ...
De Crescenzo, Ilaria +2 more
core +8 more sources
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs [PDF]
, 2019 This paper studies propositional proof systems in which lines are sequents of decision trees or branching programs, deterministic or non-deterministic.
Buss, Sam, Das, Anupam, Knop, Alexander
core +4 more sources
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure [PDF]
, 2007 String languages recognizable in (deterministic) log-space are characterized either by two-way (deterministic) multi-head automata, or following Immerman, by first-order logic with (deterministic) transitive closure.
Hendrik Jan Hoogeboom +2 more
core +5 more sources
Distributed Graph Automata and Verification of Distributed Algorithms [PDF]
, 2014 Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order logic.
Reiter, Fabian
core +1 more source
Generalizing input-driven languages: theoretical and practical benefits [PDF]
, 2017 Regular languages (RL) are the simplest family in Chomsky's hierarchy. Thanks to their simplicity they enjoy various nice algebraic and logic properties that have been successfully exploited in many application fields.
Mandrioli, Dino, Pradella, Matteo
core +2 more sources
Lipschitz Robustness of Finite-state Transducers [PDF]
, 2014 We investigate the problem of checking if a finite-state transducer is robust to uncertainty in its input. Our notion of robustness is based on the analytic notion of Lipschitz continuity --- a transducer is K-(Lipschitz) robust if the perturbation in ...
Henzinger, Thomas A. +2 more
core +4 more sources
The Complexity of Enriched Mu-Calculi [PDF]
, 2008 The fully enriched μ-calculus is the extension of the propositional μ-calculus with inverse programs, graded modalities, and nominals. While satisfiability in several expressive fragments of the fully enriched μ-calculus is known to be decidable
Aniello Murano +4 more
core +1 more source
Exploiting the Temporal Logic Hierarchy and the Non-Confluence Property for Efficient LTL Synthesis
, 2010 The classic approaches to synthesize a reactive system from a linear temporal logic (LTL) specification first translate the given LTL formula to an equivalent omega-automaton and then compute a winning strategy for the corresponding omega-regular game ...
A. Morgenstern +34 more
core +2 more sources
How unprovable is Rabin's decidability theorem?
, 2015 We study the strength of set-theoretic axioms needed to prove Rabin's theorem on the decidability of the MSO theory of the infinite binary tree. We first show that the complementation theorem for tree automata, which forms the technical core of typical ...
Beckmann A. +6 more
core +1 more source
Making Random Choices Invisible to the Scheduler [PDF]
, 2007 When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to solve the nondeterminism.
Chatzikokolakis, Konstantinos +1 more
core +7 more sources