Coalgebraic Semantics of Heavy-Weighted Automata. - Marie Fortin; Marcello M. Bonsangue; Jan Rutten (WADT, 2014)

Verification of Parameterized Communicating Automata via Split-Width. - Marie Fortin; Paul Gastin (FoSSaCS, 2016)

On parametrized verification of asynchronous, shared-memory pushdown systems. - Marie Fortin; Anca Muscholl; Igor Walukiewicz (CoRR, 2016)

Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems. - Marie Fortin; Anca Muscholl; Igor Walukiewicz (CAV (2), 2017)

It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before". - Benedikt Bollig; Marie Fortin; Paul Gastin (CONCUR, 2018)

Communicating Finite-State Machines and Two-Variable Logic. - Benedikt Bollig; Marie Fortin; Paul Gastin (STACS, 2018)

Gossiping in Message-Passing Systems. - Benedikt Bollig; Marie Fortin; Paul Gastin (CoRR, 2018)

FO = FO3 for Linear Orders with Monotone Binary Relations. - Marie Fortin (ICALP, 2019)

FO = FO3 for linear orders with monotone binary relations. - Marie Fortin (CoRR, 2019)

Expressivité de la logique du premier ordre, de la logique dynamique propositionnelle sans étoile et des automates communicants. (Expressivity of first-order logic, star-free propositional dynamic logic and communicating automata). - Marie Fortin (2020)

Interpolants and Explicit Definitions in Horn Description Logics (Extended Abstract). - Marie Fortin; Boris Konev; Frank Wolter (Description Logics, 2021)

HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete. - Marie Fortin; Louwe B. Kuijer; Patrick Totzke; Martin Zimmermann 002 (MFCS, 2021)

HyperLTL Satisfiability is Σ11-complete, HyperCTL* Satisfiability is Σ12-complete. - Marie Fortin; Louwe B. Kuijer; Patrick Totzke; Martin Zimmermann 002 (CoRR, 2021)

Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic. - Benedikt Bollig; Marie Fortin; Paul Gastin (J. Comput. Syst. Sci., 2021)

Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps (Extended Abstract). - Marie Fortin; Boris Konev; Vladislav Ryzhikov; Yury Savateev; Frank Wolter; Michael Zakharyaschev (Description Logics, 2022)

Unique Characterisability and Learnability of Temporal Instance Queries. - Marie Fortin; Boris Konev; Vladislav Ryzhikov; Yury Savateev; Frank Wolter; Michael Zakharyaschev (KR, 2022)

Interpolants and Explicit Definitions in Extensions of the Description Logic EL. - Marie Fortin; Boris Konev; Frank Wolter (KR, 2022)

Reverse Engineering of Temporal Queries Mediated by LTL Ontologies. - Marie Fortin; Boris Konev; Vladislav Ryzhikov; Yury Savateev; Frank Wolter; Michael Zakharyaschev (IJCAI, 2023)

Logic and Languages of Higher-Dimensional Automata. - Amazigh Amrane; Hugo Bazille; Uli Fahrenberg; Marie Fortin (DLT, 2024)

High-Level Message Sequence Charts: Satisfiability and Realizability Revisited. - Benedikt Bollig; Marie Fortin; Paul Gastin (Petri Nets, 2025)

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder. - Marie Fortin; Louwe B. Kuijer; Patrick Totzke; Martin Zimmermann 002 (Log. Methods Comput. Sci., 2025)

Büchi-Elgot-Trakhtenbrot Theorem for Higher-Dimensional Automata. - Amazigh Amrane; Hugo Bazille; Emily Clement; Uli Fahrenberg; Marie Fortin; Krzysztof Ziemianski (CoRR, 2025)