We are seeing an increased push in the use of formal verification techniques in safety-
critical software and hardware in practice. Formal verification has been successfully used to …

In this paper we study when an LTL formula on finite traces (LTLf formula) is insensitive to
infiniteness, that is, it can be correctly handled as a formula on infinite traces under the …

We introduce improvements in the algorithm by Gastin and Oddoux translating LTL formulae
into Büchi automata via very weak alternating co-Büchi automata and generalized Büchi …

We study two fundamental questions in neuro-symbolic computing: can deep learning tackle
challenging problems in logics end-to-end, and can neural networks learn the semantics of …

Many novel application scenarios and architectures in business process management or
service composition are characterized by a distribution of activities and resources, and by …

Abstract Linear Temporal Logic over finite traces (LTL f) was proposed in 2013 and has
attracted increasing interest around the AI community. Though the theoretic basis for LTL f …

Advancement of AI-enhanced control in autonomous systems stands on the shoulders of
formal methods, which make possible the rigorous safety analysis autonomous systems …

Temporal stream logic (TSL) extends LTL with updates and predicates over arbitrary
function terms. This allows for specifying dataintensive systems for which LTL is not …

Spot is a library of model-checking algorithms started in 2003. This paper focuses on its
module for translating linear-time temporal logic (LTL) formulas into Büchi automata: one of …

Mission-time LTL (MLTL) is a bounded variant of MTL over naturals designed to generically
specify requirements for mission-based system operation common to aircraft, spacecraft …