English
Related papers

Related papers: LTL-based Verification of Reconfigurable Workflows

200 papers

Applying dynamic logics to program verifications is a challenge, because their axiomatic rules for regular expressions can be difficult to be adapted to different program models. We present a novel dynamic logic, called DLp, which supports…

Logic in Computer Science · Computer Science 2026-02-11 Yuanrui Zhang

In this paper we present the design and implementation, as well as a use case, of a tool for workflow analysis. The tool provides an assistant for the specification of properties of a workflow model. The specification language for property…

Software Engineering · Computer Science 2014-01-07 Germán Regis , Fernando Villar , Nicolás Ricci

Effectively translating between natural language (NL) and formal logics like Linear Temporal Logic (LTL) requires expertise that limits formal verification's reach in safety-critical development. Template-based approaches sacrifice…

Artificial Intelligence · Computer Science 2026-05-25 Paapa Kwesi Quansah , Ernest Bonnah

Automatic or assisted workflow composition is a field of intense research for applications to the world wide web or to business process modeling. Workflow composition is traditionally addressed in various ways, generally via theorem proving…

Artificial Intelligence · Computer Science 2007-05-23 Patrick Albert , Laurent Henocque , Mathias Kleiner

Linear temporal logic (LTL) is a compelling framework for specifying complex, structured tasks for reinforcement learning (RL) agents. Recent work has shown that interpreting LTL instructions as finite automata, which can be seen as…

Artificial Intelligence · Computer Science 2025-12-03 Mattia Giuri , Mathias Jackermeier , Alessandro Abate

Linear Temporal Logic (LTL) is the standard specification language for reactive systems and is successfully applied in industrial settings. However, many shortcomings of LTL have been identified in the literature, among them the limited…

Logic in Computer Science · Computer Science 2019-09-19 Daniel Neider , Alexander Weinert , Martin Zimmermann

Alloy is formal modeling language based on first-order relational logic, with no specific support for specifying reactive systems. We propose the usage of temporal logic to specify such systems, and show how bounded model checking can be…

Software Engineering · Computer Science 2015-06-26 Alcino Cunha

This paper investigates the planning and control problems for multi-robot systems under linear temporal logic (LTL) specifications. In contrast to most of existing literature, which presumes a static and known environment, our study focuses…

Robotics · Computer Science 2023-07-13 Pian Yu , Gianmarco Fedeli , Dimos V. Dimarogonas

This paper presents an incremental replanning algorithm, dubbed LTL-D*, for temporal-logic-based task planning in a dynamically changing environment. Unexpected changes in the environment may lead to failures in satisfying a task…

Robotics · Computer Science 2024-04-02 Jiming Ren , Haris Miller , Karen M. Feigh , Samuel Coogan , Ye Zhao

Multi-Agent Systems (MAS) are notoriously complex and hard to verify. In fact, it is not trivial to model a MAS, and even when a model is built, it is not always possible to verify, in a formal way, that it is actually behaving as we…

Logic in Computer Science · Computer Science 2023-06-19 Angelo Ferrando , Vadim Malvone

Recent advances have shown that scaling test-time computation enables large language models (LLMs) to solve increasingly complex problems across diverse domains. One effective paradigm for test-time scaling (TTS) involves LLM generators…

Computation and Language · Computer Science 2026-04-15 Yefan Zhou , Austin Xu , Yilun Zhou , Janvijay Singh , Jiang Gui , Shafiq Joty

Business processes need to have certain constraints such that they can lead to sustainable outcomes. These constraints can be manifold and their adherence has to be monitored. In the past compliance checking has been applied in several…

Computers and Society · Computer Science 2020-06-19 Clemens Schreiber

Legal properties involve reasoning about data values and time. Metric first-order temporal logic (MFOTL) provides a rich formalism for specifying legal properties. While MFOTL has been successfully used for verifying legal properties over…

Software Engineering · Computer Science 2023-05-30 Nick Feng , Lina Marsso , Mehrdad Sabetzadeh , Marsha Chechik

Autonomous agents often face the challenge of interpreting uncertain natural language instructions for planning tasks. Representing these instructions as Linear Temporal Logic (LTL) enables planners to synthesize actionable plans. We…

Robotics · Computer Science 2025-09-30 Kumar Manas , Stefan Zwicklbauer , Adrian Paschke

Agentic systems powered by Large Language Models (LLMs) have demonstrated remarkable potential in tackling complex, long-horizon tasks. However, their efficacy is fundamentally constrained by static configurations governing agent behaviors,…

Artificial Intelligence · Computer Science 2026-02-24 Jingqi Zhou , Sheng Wang , DeZhao Deng , Junwen Lu , Junwei Su , Qintong Li , Jiahui Gao , Hao Wu , Jiyue Jiang , Lingpeng Kong , Chuan Wu

HyperLTL, the extension of Linear Temporal Logic by trace quantifiers, is a uniform framework for expressing information flow policies by relating multiple traces of a security-critical system. HyperLTL has been successfully applied to…

Logic in Computer Science · Computer Science 2019-12-17 Corto Mascle , Martin Zimmermann

Reasoning Large Language Models (LLMs) have shown promising results when tasked with solving complex problems. In this paper, we propose and evaluate a multi-stage workflow that leverages the capabilities of fine-tuned reasoning LLMs to…

Computation and Language · Computer Science 2026-01-13 Alberto Purpura , Emily Chen , Swapnil Shinde

Latency-insensitive design mitigates increasing interconnect delay and enables productive component reuse in complex digital systems. This design style has been adopted in high-level design flows because untimed functional blocks connected…

Logic in Computer Science · Computer Science 2021-02-19 Steve Dai , Alicia Klinefelter , Haoxing Ren , Rangharajan Venkatesan , Ben Keller , Nathaniel Pinckney , Brucek Khailany

The expressive power of interval temporal logics (ITLs) makes them one of the most natural choices in a number of application domains, ranging from the specification and verification of complex reactive systems to automated planning.…

Logic in Computer Science · Computer Science 2023-06-22 Laura Bozzelli , Alberto Molinari , Angelo Montanari , Adriano Peron , Pietro Sala

Model checking approaches can be divided into two broad categories: global approaches that determine the set of all states in a model M that satisfy a temporal logic formula f, and local approaches in which, given a state s in M, the…

Logic in Computer Science · Computer Science 2014-10-29 Diego Latella , Michele Loreti , Mieke Massink
‹ Prev 1 4 5 6 7 8 10 Next ›