Jérémy Ledent

Roman Kniazev

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023

Simplicial Models for the Epistemic Logic of Faulty Agents.

[BibT_eX]

[DOI]

CoRR, 2023

Semi-Simplicial Set Models for Distributed Knowledge.

[BibT_eX]

[DOI]

LICS, 2023

2022

A quantitative model for simply typed λ-calculus.

[BibT_eX]

[DOI]

Martin Hofmann

Math. Struct. Comput. Sci., June, 2022

Two-Agent Approximate Agreement from an Epistemic Logic Perspective.

[BibT_eX]

[DOI]

Jorge Armenta-Segura

Computación y Sistemas, 2022

A Simplicial Model for KB4_n: Epistemic Logic with Agents That May Die.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021

A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2021

A Simplicial Model for KB4<sub>n</sub>: Epistemic Logic with Agents that May Die.

[BibT_eX]

[DOI]

Eric Goubault

CoRR, 2021

Translating Extensive Form Games to Open Games with Agency.

[BibT_eX]

[DOI]

Matteo Capucci

Neil Ghani

Fredrik Nordvall Forsberg

Proceedings of the Fourth International Conference on Applied Category Theory, 2021

Brief Announcement: Variants of Approximate Agreement on Graphs and Simplicial Complexes.

[BibT_eX]

[DOI]

Fredrik Nordvall Forsberg

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020

Compositional Game Theory, Compositionally.

[BibT_eX]

[DOI]

Proceedings of the 3rd Annual International Applied Category Theory Conference 2020, 2020

Knowledge and simplicial complexes.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Geometric semantics for asynchronous computability. (Sémantique géométrique pour la calculabilité asynchrone).

[BibT_eX]

[DOI]

PhD thesis, 2019

Wait-Free Solvability of Equality Negation Tasks.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

A Dynamic Epistemic Logic Analysis of the Equality Negation Task.

[BibT_eX]

[DOI]

Proceedings of the Dynamic Logic. New Trends and Applications, 2019

A Sound Foundation for the Topological Approach to Task Solvability.

[BibT_eX]

[DOI]

Samuel Mimram

Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018

A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task Computability.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Ninth International Symposium on Games, 2018

Brief Announcement: On the Impossibility of Detecting Concurrency.

[BibT_eX]

[DOI]

Samuel Mimram

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Concurrent Specifications Beyond Linearizability.

[BibT_eX]

[DOI]

Samuel Mimram

Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

2017

A cartesian-closed category for higher-order model checking.

[BibT_eX]

[DOI]

Martin Hofmann