output
20062021
most citedModel-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable

77 citations

researchers with a paper here
collaborating institutions
Showing 2015Show all

7 papers · 1 filter

cs.LO2015

Contextual equivalences in configuration structures and reversibility

Clément Aubert, Ioana Cristescu

Contextual equivalence equate terms that have the same observable behaviour in any context. A standard contextual equivalence for CCS is the strong barbed congruence. Configuration…

cs.LO2015★ 7 cited

Reversible Barbed Congruence on Configuration Structures

Clément Aubert, Ioana Cristescu

A standard contextual equivalence for process algebras is strong barbed congruence. Configuration structures are a denotational semantics for processes in which one can define equi…

cs.GT2015★ 11 cited

Entropy Games and Matrix Multiplication Games

Eugene Asarin, Julien Cervelle, Aldric Degorre +3

Two intimately related new classes of games are introduced and studied: entropy games (EGs) and matrix multiplication games (MMGs). An EG is played on a finite arena by two-and-a-h…

math.NT2015★ 2 cited

Characterizing congruence preserving functions via rational polynomials

Patrick Cegielski, Serge Grigorieff, Irene Guessarian

We introduce a basis of rational polynomial-like functions for the free module of functions . We then characterize the subfamily of congruence pr…

cs.LO2015★ 7 cited

Non-normal modalities in variants of Linear Logic

Daniele Porello, Nicolas Troquard

This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of Linear Logic with one minimal non-normal modality. In earlier work, w…

cs.LO2015

An in-between "implicit" and "explicit" complexity: Automata

Clément Aubert

Implicit Computational Complexity makes two aspects implicit, by manipulating programming languages rather than models of com-putation, and by internalizing the bounds rather than…