Jérémy Ledent

28 papers A* 3A 3B 4Journal 13Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Distributed Knowledge in Simplicial Models.
CoRR
Éric Goubault, Jérémy Ledent, Sergio Rajsbaum
2026 B conf
Kamp Theorem for Pomset Languages of Higher Dimensional Automata.
CSL
Emily Clement, Enzo Erlich, Jérémy Ledent
2025 J jnl
A categorical and logical framework for iterated protocols.
CoRR
Eric Goubault, Bernardo Hummes Flores, Roman Kniazev, Jérémy Ledent, Sergio Rajsbaum
2024 B conf
A Many-Sorted Epistemic Logic for Chromatic Hypergraphs.
CSL
Éric Goubault, Roman Kniazev, Jérémy Ledent
2024 J jnl
Expressivity of Linear Temporal Logic for Pomset Languages of Higher Dimensional Automata.
CoRR
Emily Clement, Enzo Erlich, Jérémy Ledent
2023 J jnl
A many-sorted epistemic logic for chromatic hypergraphs.
CoRR
Eric Goubault, Roman Kniazev, Jérémy Ledent
2023 A* conf
Semi-Simplicial Set Models for Distributed Knowledge.
LICS
Éric Goubault, Roman Kniazev, Jérémy Ledent, Sergio Rajsbaum
2023 J jnl
Semi-simplicial Set Models for Distributed Knowledge.
CoRR
Eric Goubault, Roman Kniazev, Jérémy Ledent, Sergio Rajsbaum
2023 J jnl
Simplicial Models for the Epistemic Logic of Faulty Agents.
CoRR
Eric Goubault, Roman Kniazev, Jérémy Ledent, Sergio Rajsbaum
2022 A conf
A Simplicial Model for KB4_n: Epistemic Logic with Agents That May Die.
STACS
Éric Goubault, Jérémy Ledent, Sergio Rajsbaum
2022 J jnl
A quantitative model for simply typed λ-calculus.
Math. Struct. Comput. Sci.
Martin Hofmann, Jérémy Ledent
2022 J jnl
Two-Agent Approximate Agreement from an Epistemic Logic Perspective.
Computación y Sistemas
Jorge Armenta-Segura, Jérémy Ledent, Sergio Rajsbaum
2021 J jnl
A Simplicial Model for KB4
CoRR
Eric Goubault, Jérémy Ledent, Sergio Rajsbaum
2021 J jnl
A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks.
J. Log. Algebraic Methods Program.
Hans van Ditmarsch, Éric Goubault, Marijana Lazic, Jérémy Ledent, Sergio Rajsbaum
2021 J jnl
A simplicial complex model for dynamic epistemic logic to study distributed task computability.
Inf. Comput.
Éric Goubault, Jérémy Ledent, Sergio Rajsbaum
2021 A* conf
Brief Announcement: Variants of Approximate Agreement on Graphs and Simplicial Complexes.
PODC
Jérémy Ledent
2021 — conf
Translating Extensive Form Games to Open Games with Agency.
ACT
Matteo Capucci, Neil Ghani, Jérémy Ledent, Fredrik Nordvall Forsberg
2020 — conf
Compositional Game Theory, Compositionally.
ACT
Robert Atkey, Bruno Gavranovic, Neil Ghani, Clemens Kupke, Jérémy Ledent, Fredrik Nordvall Forsberg
2020 J jnl
Knowledge and simplicial complexes.
CoRR
Hans van Ditmarsch, Eric Goubault, Jérémy Ledent, Sergio Rajsbaum
2019 — conf
A Dynamic Epistemic Logic Analysis of the Equality Negation Task.
DaLí
Éric Goubault, Marijana Lazic, Jérémy Ledent, Sergio Rajsbaum
2019 B conf
A Sound Foundation for the Topological Approach to Task Solvability.
CONCUR
Jérémy Ledent, Samuel Mimram
2019 J jnl
A dynamic epistemic logic analysis of the equality negation task.
CoRR
Eric Goubault, Marijana Lazic, Jérémy Ledent, Sergio Rajsbaum
2019 — —
Geometric semantics for asynchronous computability. (Sémantique géométrique pour la calculabilité asynchrone).
Jérémy Ledent
2019 A conf
Wait-Free Solvability of Equality Negation Tasks.
DISC
Éric Goubault, Marijana Lazic, Jérémy Ledent, Sergio Rajsbaum
2018 — conf
A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task Computability.
GandALF
Éric Goubault, Jérémy Ledent, Sergio Rajsbaum
2018 A conf
Brief Announcement: On the Impossibility of Detecting Concurrency.
DISC
Éric Goubault, Jérémy Ledent, Samuel Mimram
2018 B conf
Concurrent Specifications Beyond Linearizability.
OPODIS
Éric Goubault, Jérémy Ledent, Samuel Mimram
2017 A* conf
A cartesian-closed category for higher-order model checking.
LICS
Martin Hofmann, Jérémy Ledent