English
Related papers

Related papers: Evaluation of Temporal Formulas Based on "Checking…

200 papers

Many Cyber Physical System (CPS) work in a safety-critical environment, where correct execution, reliability and trustworthiness are essential. Signal Temporal Logic (STL) provides a formal framework for checking safety-critical CPS.…

Formal Languages and Automata Theory · Computer Science 2026-03-27 Partha Roop , Sobhan Chatterjee , Avinash Malik , Nathan Allen , Logan Kenwright

This paper describes a method for converting formulas in finite propositional linear-time temporal logic (Finite LTL) into finite-state automata whose languages are the models of the given formula. Finite LTL differs from traditional LTL in…

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

Metric Temporal Logic (MTL) is a popular formalism to specify temporal patterns with timing constraints over the behavior of cyber-physical systems with application areas ranging in property-based testing, robotics, optimization, and…

Logic in Computer Science · Computer Science 2026-03-11 Dogan Ulus

Signal Temporal Logic (STL) is a formalism used to rigorously specify requirements of cyberphysical systems (CPS), i.e., systems mixing digital or discrete components in interaction with a continuous environment or analog com- ponents. STL…

Systems and Control · Computer Science 2015-06-30 Jyotirmoy V. Deshmukh , Alexandre Donzé , Shromona Ghosh , Xiaoqing Jin , Garvit Juniwal , Sanjit A. Seshia

Runtime verification is the process of verifying critical behavioral properties in big complex systems, where formal verification is not possible due to state space explosion. There have been several attempts to design efficient algorithms…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-04-07 M. Ali Dorosty , Fathiyeh Faghih , Ehsan Khamespanah

This paper presents a new technique for optimizing formal analysis of propositional logic formulas and Linear Temporal Logic (LTL) formulas, namely the formula simplification table. A formula simplification table is a mathematical table…

Logic in Computer Science · Computer Science 2018-11-01 Omar Al-Bataineh , David Rosenblum , Mark Reynolds

We introduce a model-checking tool intended specially for the analysis of quantum information protocols. The tool incorporates an efficient representation of a certain class of quantum circuits, namely those expressible in the so-called…

Quantum Physics · Physics 2008-04-21 Simon Gay , Rajagopal Nagarajan , Nikolaos Papanikolaou

This paper investigates the online monitoring problem for cyber-physical systems under signal temporal logic (STL) specifications. The objective is to design an online monitor that evaluates system correctness at runtime based on partial…

Optimization and Control · Mathematics 2025-05-27 Tao Han , Shaoyuan Li , Xiang Yin

Clustering is ubiquitous in data analysis, including analysis of time series. It is inherently subjective: different users may prefer different clusterings for a particular dataset. Semi-supervised clustering addresses this by allowing the…

Machine Learning · Statistics 2018-05-03 Toon Van Craenendonck , Wannes Meert , Sebastijan Dumancic , Hendrik Blockeel

Alternating-time temporal logic with strategy contexts (ATLsc) is a powerful formalism for expressing properties of multi-agent systems: it extends CTL with strategy quantifiers, offering a convenient way of expressing both collaboration…

Logic in Computer Science · Computer Science 2015-09-25 François Laroussinie , Nicolas Markey , Arnaud Sangnier

Satisfiability checking for Linear Temporal Logic (LTL) is a fundamental step in checking for possible errors in LTL assertions. Extant LTL satisfiability checkers use a variety of different search procedures. With the sole exception of LTL…

Logic in Computer Science · Computer Science 2014-04-30 Jianwen Li , Geguang Pu , Lijun Zhang , Moshe Y. Vardi , Jifeng He

This paper studies Linear Temporal Logic over Finite Traces (LTLf) where proposition letters are replaced with first-order formulas interpreted over arbitrary theories, in the spirit of Satisfiability Modulo Theories. The resulting logic,…

Logic in Computer Science · Computer Science 2022-05-25 Luca Geatti , Alessandro Gianola , Nicola Gigante

Large Language Models (LLMs) increasingly rely on long-form, multi-step reasoning to solve complex tasks such as mathematical problem solving and scientific question answering. Despite strong performance, existing confidence estimation…

Computation and Language · Computer Science 2026-01-21 Zhenjiang Mao , Anirudhh Venkat , Artem Bisliouk , Akshat Kothiyal , Sindhura Kumbakonam Subramanian , Saithej Singhu , Ivan Ruchkin

Test-time scaling (TTS) techniques can improve the performance of large language models (LLMs) at the expense of additional computation and latency. While TTS has proven effective in formal domains such as mathematics and programming, its…

Computation and Language · Computer Science 2025-10-31 Davide Romano , Jonathan Schwarz , Daniele Giofré

The following paper proposes a new approach to determine whether a logical (CNF) formula is satisfiable or not using probability theory methods. Furthermore, we will introduce an algorithm that speeds up the standard solution for (CNF-SAT)…

Logic in Computer Science · Computer Science 2021-04-26 Hazem J. Alkhatib , Majd N. Bohssas , Rawad H. Hatem , Odey N. Kassam Alhennawi

Signal Temporal Logic (STL) is widely used to specify timed and safety-critical tasks for cyber-physical systems, but writing STL formulas directly is difficult for non-expert users. Natural language (NL) provides a convenient interface,…

Computation and Language · Computer Science 2026-03-31 Kosei Fushimi , Kazunobu Serizawa , Junya Ikemoto , Kazumune Hashimoto

Runtime verification is an effective automated method for specification-based offline testing and analysis as well as online monitoring of complex systems. The specification language is often a variant of regular expressions or a popular…

Logic in Computer Science · Computer Science 2014-11-11 Ramy Medhat , Yogi Joshi , Borzoo Bonakdarpour , Sebastian Fischmeister

The integration of cyber-physical systems (CPS) into everyday life raises the critical necessity of ensuring their safety and reliability. An important step in this direction is requirement mining, i.e. inferring formally specified system…

Machine Learning · Computer Science 2024-05-24 Gaia Saveri , Luca Bortolussi

Since the introduction of Alternating-time Temporal Logic (ATL), many logics have been proposed to reason about different strategic capabilities of the agents of a system. In particular, some logics have been designed to reason about the…

Logic in Computer Science · Computer Science 2017-09-08 Simon Busard , Charles Pecheur

Many important properties of cyber-physical systems (CPS) are defined upon the relationship between multiple executions simultaneously in continuous time. Examples include probabilistic fairness and sensitivity to modeling errors (i.e.,…

Logic in Computer Science · Computer Science 2019-08-07 Yu Wang , Mojtaba Zarei , Borzoo Bonakdarpour , Miroslav Pajic