{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T19:10:04Z","timestamp":1752520204753,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T00:00:00Z","timestamp":1752019200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T00:00:00Z","timestamp":1752019200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T00:00:00Z","timestamp":1752019200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2024,10,2]]},"abstract":"<jats:p>Temporal logics are widely used by the Formal Methods and AI communities. Linear Temporal Logic is a popular temporal logic and is valued for its ease of use as well as its balance between expressiveness and complexity. LTL is equivalent in expressiveness to Monadic First-Order Logic and satisfiability for LTL is PSPACE-complete. Linear Dynamic Logic (LDL), another temporal logic, is equivalent to Monadic Second-Order Logic, but its method of satisfiability checking cannot be applied to a nontrivial subset of LDL formulas.  Here we introduce Automata Linear Dynamic Logic on Finite Traces (ALDL_f) and show that satisfiability for ALDL_f formulas is in PSPACE. A variant of Linear Dynamic Logic on Finite Traces (LDL_f), ALDL_f combines propositional logic with nondeterministic finite automata (NFA) to express temporal constraints. ALDL$_f$ is equivalent in expressiveness to Monadic Second-Order Logic. This is a gain in expressiveness over LTL at no cost.<\/jats:p>","DOI":"10.46298\/lmcs-21(3:2)2025","type":"journal-article","created":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T18:30:05Z","timestamp":1752517805000},"source":"Crossref","is-referenced-by-count":0,"title":["Automata Linear Dynamic Logic on Finite Traces"],"prefix":"10.46298","volume":"Volume 21, Issue 3","author":[{"given":"Kevin W.","family":"Smith","sequence":"first","affiliation":[]},{"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2025,7,9]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/2108.12003v6","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/2108.12003v6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T18:30:06Z","timestamp":1752517806000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/11729"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,9]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-21(3:2)2025","relation":{"has-preprint":[{"id-type":"arxiv","id":"2108.12003v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2108.12003v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2108.12003v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2108.12003","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2108.12003","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,9]]},"article-number":"11729"}}