English
Related papers

Related papers: Revisiting MITL to Fix Decision Procedures

200 papers

This paper introduces time window temporal logic (TWTL), a rich expressivity language for describing various time bounded specifications. In particular, the syntax and semantics of TWTL enable the compact representation of serial tasks,…

Formal Languages and Automata Theory · Computer Science 2016-02-16 Cristian-Ioan Vasile , Derya Aksaray , Calin Belta

Process mining extracts valuable insights from event data to help organizations improve their business processes, which is essential for their growth and success. By leveraging process mining techniques, organizations gain a comprehensive…

Databases · Computer Science 2024-06-14 Nesma M. Zaki , Iman M. A. Helal , Ehab E. Hassanein , Ahmed Awad

Linear Temporal Logic (LTL) is a widely used task specification language for autonomous systems. To mitigate the significant manual effort and expertise required to define LTL-encoded tasks, several methods have been proposed for…

Computation and Language · Computer Science 2026-02-23 David Smith Sundarsingh , Jun Wang , Jyotirmoy V. Deshmukh , Yiannis Kantaros

The emergence of the Industrial Internet results in an increasing number of complicated temporal interdependencies between automation systems and the processes to be controlled. There is a need for verification methods that scale better…

Software Engineering · Computer Science 2017-04-26 Eero Siivola , Seppo Sierla , Hannu Niemistö , Tommi Karhela , Valeriy Vyatkin

First-order linear temporal logic (FOLTL) is a flexible and expressive formalism capable of naturally describing complex behaviors and properties. Although the logic is in general highly undecidable, the idea of using it as a specification…

Logic in Computer Science · Computer Science 2024-05-31 Luca Geatti , Alessandro Gianola , Nicola Gigante

We develop a timeout based extension of propositional linear temporal logic (which we call TLTL) to specify timing properties of timeout based models of real time systems. TLTL formulas explicitly refer to a running global clock together…

Logic in Computer Science · Computer Science 2010-12-20 Janardan Misra , Suman Roy

Linear temporal logic (LTL) is a specification language for finite sequences (called traces) widely used in program verification, motion planning in robotics, process mining, and many other areas. We consider the problem of learning LTL…

Artificial Intelligence · Computer Science 2026-01-22 Ritam Raha , Rajarshi Roy , Nathanaël Fijalkow , Daniel Neider

The model-checking problem for hybrid systems is a well known challenge in the scientific community. Most of the existing approaches and tools are limited to safety properties only, or operates by transforming the hybrid system to be…

Logic in Computer Science · Computer Science 2013-08-27 Davide Bresolin

In this paper the reversibility of executable Interval Temporal Logic (ITL) specifications is investigated. ITL allows for the reasoning about systems in terms of behaviours which are represented as non-empty sequences of states. It allows…

Formal Languages and Automata Theory · Computer Science 2021-07-12 Antonio Cau , Stefan Kuhn , James Hoey

[...] The most famous model checking (MC) techniques were developed from the late 80s, bearing in mind the well-known "point-based" temporal logics LTL and CTL. However, while the expressiveness of such logics is beyond doubt, there are…

Logic in Computer Science · Computer Science 2019-02-12 Alberto Molinari

Mission-time Linear Temporal Logic (MLTL) is rapidly increasing in popularity as a specification logic, e.g., for runtime verification and model checking, driving a need for a trustworthy tool base for analyzing MLTL. In this work, we…

Logic in Computer Science · Computer Science 2025-03-03 Katherine Kosaian , Zili Wang , Elizabeth Sloan , Kristin Rozier

We propose algorithms for performing model checking and control synthesis for discrete-time uncertain systems under linear temporal logic (LTL) specifications. We construct temporal logic trees (TLT) from LTL formulae via reachability…

Systems and Control · Electrical Eng. & Systems 2020-07-07 Yulong Gao , Alessandro Abate , Frank J. Jiang , Mirco Giacobbe , Lihua Xie , Karl H. Johansson

The paper is focused on temporal logics for the description of the behaviour of real-time pushdown reactive systems. The paper is motivated to bridge tractable logics specialized for expressing separately dense-time real-time properties and…

Logic in Computer Science · Computer Science 2018-08-16 Laura Bozzelli , Aniello Murano , Adriano Peron

This paper describes a technique for inferring temporal-logic properties for sets of finite data streams. Such data streams arise in many domains, including server logs, program testing, and financial and marketing data; temporal-logic…

Logic in Computer Science · Computer Science 2020-06-09 Samuel Huang , Rance Cleaveland

We present a novel automata-based approach to address linear temporal logic modulo theory (LTL-MT) as a specification language for data words. LTL-MT extends LTL_f by replacing atomic propositions with quantifier-free multi-sorted…

Logic in Computer Science · Computer Science 2024-08-19 Marco Faella , Gennaro Parlato

Linear Temporal Logic (LTL) is a widely used specification framework for linear time properties of systems. The standard approach for verifying such properties is by transforming LTL formulae to suitable $\omega$-automata and then applying…

Formal Languages and Automata Theory · Computer Science 2017-10-19 Martin Sulzmann , Peter Thiemann

Alternating timed automata (ATA) are an extension of timed automata, that are closed under complementation and hence amenable to logic-to-automata translations. Several timed logics, including Metric Temporal Logic (MTL), can be converted…

Logic in Computer Science · Computer Science 2026-01-07 Patricia Bouyer , B Srivathsan , Vaishnavi Vishwanath

Verification of temporal logic properties plays a crucial role in proving the desired behaviors of hybrid systems. In this paper, we propose an interval method for verifying the properties described by a bounded linear temporal logic. We…

Logic in Computer Science · Computer Science 2015-07-15 Daisuke Ishii , Naoki Yonezaki , Alexandre Goldsztejn

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…

Logic in Computer Science · Computer Science 2025-07-16 Kevin W. Smith , Moshe Y. Vardi

Previous work has shown that reasoning with real-time temporal logics is often simpler when restricted to models with bounded variability---where no more than v events may occur every V time units, for given v, V. When reasoning about…

Logic in Computer Science · Computer Science 2015-02-24 Carlo A. Furia , Paola Spoletini