Marie Fortin

According to our database, Marie Fortin authored at least 20 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Logic and Languages of Higher-Dimensional Automata.

Amazigh Amrane, Hugo Bazille, Uli Fahrenberg, Marie Fortin

CoRR, 2024

2023

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL* is Even Harder.

Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann

CoRR, 2023

Reverse Engineering of Temporal Queries Mediated by LTL Ontologies.

Marie Fortin, Boris Konev, Vladislav Ryzhikov, Yury Savateev, Frank Wolter, Michael Zakharyaschev

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022

Interpolants and Explicit Definitions in Extensions of the Description Logic EL.

Marie Fortin, Boris Konev, Frank Wolter

Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, 2022

Unique Characterisability and Learnability of Temporal Instance Queries.

Marie Fortin, Boris Konev, Vladislav Ryzhikov, Yury Savateev, Frank Wolter, Michael Zakharyaschev

Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, 2022

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

Proceedings of the 35th International Workshop on Description Logics (DL 2022) co-located with Federated Logic Conference (FLoC 2022), 2022

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

HyperLTL Satisfiability is Σ₁¹-complete, HyperCTL* Satisfiability is Σ₁²-complete.

Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann

CoRR, 2021

HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete.

Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Interpolants and Explicit Definitions in Horn Description Logics (Extended Abstract).

Marie Fortin, Boris Konev, Frank Wolter

Proceedings of the 34th International Workshop on Description Logics (DL 2021) part of Bratislava Knowledge September (BAKS 2021), 2021

2020

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

PhD thesis, 2020

2019

FO = FO3 for linear orders with monotone binary relations.

Marie Fortin

CoRR, 2019

FO = FO³ for Linear Orders with Monotone Binary Relations.

Marie Fortin

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Gossiping in Message-Passing Systems.

Benedikt Bollig, Marie Fortin, Paul Gastin

CoRR, 2018

Communicating Finite-State Machines and Two-Variable Logic.

Benedikt Bollig, Marie Fortin, Paul Gastin

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

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

Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017

Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems.

Marie Fortin, Anca Muscholl, Igor Walukiewicz

Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016

On parametrized verification of asynchronous, shared-memory pushdown systems.

Marie Fortin, Anca Muscholl, Igor Walukiewicz

CoRR, 2016

Verification of Parameterized Communicating Automata via Split-Width.

Marie Fortin, Paul Gastin

Proceedings of the Foundations of Software Science and Computation Structures, 2016

2014

Coalgebraic Semantics of Heavy-Weighted Automata.

Marie Fortin, Marcello M. Bonsangue, Jan Rutten

Proceedings of the Recent Trends in Algebraic Development Techniques, 2014