Search Results - "Kuperberg, Denis"

Positive First-order Logic on Words and Graphs by Kuperberg, Denis

“…We study FO+, a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is an FO-definable…”
Get full text

Linear Temporal Logic for Regular Cost Functions by Kuperberg, Denis

“…Regular cost functions have been introduced recently as an extension to the notion of regular languages with counting capabilities, which retains strong…”
Get full text

Computing the Width of Non-deterministic Automata by Kuperberg, Denis, Majumdar, Anirban

“…We introduce a measure called width, quantifying the amount of nondetermin-ism in automata. Width generalises the notion of good-for-games (GFG) automata, that…”
Get full text

Soundness in negotiations by Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz

“…Negotiations are a formalism for describing multiparty distributed cooperation. Alternatively, they can be seen as a model of concurrency with synchronized…”
Get full text

Positive First-order Logic on Words by Kuperberg, Denis

“…We study FO + , a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is an FO-definable…”
Get full text

Positive First-order Logic on Words and Graphs by Kuperberg, Denis

“…Logical Methods in Computer Science, Volume 19, Issue 3 (July 25, 2023) lmcs:9081 We study FO+, a fragment of first-order logic on finite words, where monadic…”
Get full text

Positive and monotone fragments of FO and LTL by Kuperberg, Denis, Moreau, Quentin

“…We study the positive logic FO+ on finite words, and its fragments, pursuing and refining the work initiated in [Kuperberg 2023]. First, we transpose notorious…”
Get full text

Positive first-order logic on words by Kuperberg, Denis

“…We study FO+, a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is a FO-definable…”
Get full text

Soundness in negotiations by Esparza, Javier, Kuperberg, Denis, Muscholl, Anca, Walukiewicz, Igor

“…Negotiations are a formalism for describing multiparty distributed cooperation. Alternatively, they can be seen as a model of concurrency with synchronized…”
Get full text

Explorable Parity Automata by Hazard, Emile, Idir, Olivier, Kuperberg, Denis

“…We define the class of explorable automata on finite or infinite words. This is a generalization of History-Deterministic (HD) automata, where this time…”
Get full text

Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation by Dybjer, Peter, Kuperberg, Denis

“…We prove the correctness of an algorithm for normalizing untyped combinator terms by evaluation. The algorithm is written in the functional programming…”
Get full text

Tree algebras and bisimulation-invariant MSO on finite graphs by Colcombet, Thomas, Doumane, Amina, Kuperberg, Denis

“…We establish that the bisimulation invariant fragment of MSO over finite transition systems is expressively equivalent over finite transition systems to modal…”
Get full text

Regular resynchronizability of origin transducers is undecidable by Kuperberg, Denis, Martens, Jan

“…We study the relation of containment up to unknown regular resynchronization between two-way non-deterministic transducers. We show that it constitutes a…”
Get full text

Linear Temporal Logic for Regular Cost Functions by Kuperberg, Denis

“…Logical Methods in Computer Science, Volume 10, Issue 1 (February 4, 2014) lmcs:1222 Regular cost functions have been introduced recently as an extension to…”
Get full text

Computing the Width of Non-deterministic Automata by Kuperberg, Denis, Majumdar, Anirban

“…Logical Methods in Computer Science, Volume 15, Issue 4 (November 29, 2019) lmcs:4953 We introduce a measure called width, quantifying the amount of…”
Get full text

On the Minimisation of Deterministic and History-Deterministic Generalised (co)B\"uchi Automata by Casares, Antonio, Idir, Olivier, Kuperberg, Denis, Mascle, Corto, Prakash, Aditya

“…We present a polynomial-time algorithm minimising the number of states of history-deterministic generalised coB\"uchi automata, building on the work of Abu…”
Get full text

On the Succinctness of Alternating Parity Good-for-Games Automata by Boker, Udi, Kuperberg, Denis, Lehtinen, Karoliina, Skrzypczak, Michał

“…We study alternating parity good-for-games (GFG) automata, i.e., alternating parity automata where both conjunctive and disjunctive choices can be resolved in…”
Get full text

Bouncing threads for infinitary and circular proofs by Baelde, David, Doumane, Amina, Kuperberg, Denis, Saurin, Alexis

“…We generalize the validity criterion for the infinitary proof system of the multiplicative additive linear logic with fixed points. Our criterion is designed…”
Get full text

On Succinctness and Recognisability of Alternating Good-for-Games Automata by Boker, Udi, Kuperberg, Denis, Lehtinen, Karoliina, Skrzypczak, Michał

“…We study alternating good-for-games (GFG) automata, i.e., alternating automata where both conjunctive and disjunctive choices can be resolved in an online…”
Get full text

Soundness in negotiations by Esparza, Javier, Kuperberg, Denis, Muscholl, Anca, Walukiewicz, Igor

“…Logical Methods in Computer Science, Volume 14, Issue 1, Concurrency theory (January 16, 2018) lmcs:3196 Negotiations are a formalism for describing multiparty…”
Get full text