Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL* is Even Harder., , , and . CoRR, (2023)Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps (Extended Abstract)., , , , , and . Description Logics, volume 3263 of CEUR Workshop Proceedings, CEUR-WS.org, (2022)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).. University of Paris-Saclay, France, (2020)Coalgebraic Semantics of Heavy-Weighted Automata., , and . WADT, volume 9463 of Lecture Notes in Computer Science, page 48-68. Springer, (2014)Verification of Parameterized Communicating Automata via Split-Width., and . FoSSaCS, volume 9634 of Lecture Notes in Computer Science, page 197-213. Springer, (2016)HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete., , , and . MFCS, volume 202 of LIPIcs, page 47:1-47:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)HyperLTL Satisfiability is Σ11-complete, HyperCTL* Satisfiability is Σ12-complete., , , and . CoRR, (2021)Reverse Engineering of Temporal Queries Mediated by LTL Ontologies., , , , , and . IJCAI, page 3230-3238. ijcai.org, (2023)Unique Characterisability and Learnability of Temporal Instance Queries., , , , , and . KR, (2022)Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic., , and . J. Comput. Syst. Sci., (2021)