88 citations
- École Normale Supérieure Paris-SaclayFR90 papers
- Centre National de la Recherche ScientifiqueFR87 papers
- Institut national de recherche en sciences et technologies du numériqueFR29 papers
- Université Paris-SaclayFR16 papers
- Chennai Mathematical InstituteIN10 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR9 papers
- Institute of Science and Technology AustriaAT8 papers
- Université Libre de BruxellesBE7 papers
- Aalborg UniversityDK6 papers
- Université Paris CitéFR6 papers
- University of MonsBE6 papers
- Centre Inria de l'Université de RennesFR5 papers
9 papers · 1 filter
Termination of modulo rewriting using the size-change principle (work in progress)
Frédéric Blanqui, Guillaume Genestier
The Size-Change Termination principle was first introduced to study the termination of first-order functional programs. In this work, we show that it can also be used to study the…
On shuffle products, acyclic automata and piecewise-testable languages
Simon Halfon, Philippe Schnoebelen
We show that the shuffle $L \unicode{x29E2} F$ of a piecewise-testable language and a finite language is piecewise-testable. The proof relies on a classic but little-used a…
Observation and Distinction. Representing Information in Infinite Games
Dietmar Berwanger, Laurent Doyen
We compare two approaches for modelling imperfect information in infinite games by using finite-state automata. The first, more standard approach views information as the result of…
Most Permissive Semantics of Boolean Networks
Thomas Chatain, Stefan Haar, Juraj Kol{č}ák +1
As shown in (http://dx.doi.org/10.1101/2020.03.22.998377), the usual update modes of Boolean networks (BNs), including synchronous and (generalized) asynchronous, fail to capture b…
Convergence without points
Jean Goubault-Larrecq, Frédéric Mynard
We introduce a pointfree theory of convergence on lattices and coframes. A convergence lattice is a lattice with a monotonic map from the lattice of filters on to…
The Complexity of Bisimulation and Simulation on Finite Systems
Moses Ganardi, Stefan Göller, Markus Lohrey
In this paper the computational complexity of the (bi)simulation problem over restricted graph classes is studied. For trees given as pointer structures or terms the (bi)simulation…