activity
20012026
most citedComputing the vertices of tropical polyhedra using directed hypergraphs

54 citations · 312 across the 36 of their papers we have counts for

collaborators
Showing cs.DCShow all

5 papers · 1 filter

cs.DC2020★ 15 cited

Knowledge and simplicial complexes

Hans van Ditmarsch, Eric Goubault, Jeremy Ledent +1

Simplicial complexes are a versatile and convenient paradigm on which to build all the tools and techniques of the logic of knowledge, on the assumption that initial epistemic mode…

cs.DC2017★ 2 cited

Models of fault-tolerant distributed computation via dynamic epistemic logic

Eric Goubault, Sergio Rajsbaum

The computability power of a distributed computing model is determined by the communication media available to the processes, the timing assumptions about processes and communicati…

cs.DC2017★ 3 cited

A simplicial complex model of dynamic epistemic logic for fault-tolerant distributed computing

Eric Goubault, Sergio Rajsbaum

The usual epistemic S5 model for multi-agent systems is a Kripke graph, whose edges are labeled with the agents that do not distinguish between two states. We propose to uncover th…

cs.DC2012★ 16 cited

Trace Spaces: an Efficient New Technique for State-Space Reduction

Lisbeth Fajstrup, Eric Goubault, Emmanuel Haucourt +2

State-space reduction techniques, used primarily in model-checkers, all rely on the idea that some actions are independent, hence could be taken in any (respective) order while put…

cs.DC2010★ 26 cited

Formal Relationships Between Geometrical and Classical Models for Concurrency

Eric Goubault, Samuel Mimram

A wide variety of models for concurrent programs has been proposed during the past decades, each one focusing on various aspects of computations: trace equivalence, causality betwe…