2026-08-18T12:38:08Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:22762 2025-10-02T11:31:18Z ddc:004 open_access

Modal Automata: Analysing Modal Fixpoint Logics, One Step at a Time (Invited Talk) Venema, Yde modal logic parity automata fixpoint logic one-step logic We present and investigate a general framework for studying modal fixpoint logics and some related versions of monadic second-order logic, by means of certain finite automata that operate on Kripke structures. Characteristic of these modal automata is that the co-domain of their transition function is a set of formulas of a so-called one-step logic. The motivation for taking this perspective is that if a logic is characterised by a class of modal automata, many of its properties are already determined at the level of the much simpler one-step logic. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Yde Venema 2025 Is Part Of LIPIcs, Volume 326, 33rd EACSL Annual Conference on Computer Science Logic (CSL 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2025.5 urn:nbn:de:0030-drops-227627 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2025.5 eng https://creativecommons.org/licenses/by/4.0/legalcode