Logic-based Specification and Solving of Optimization Problems with Real-Time Constraints

Linear Temporal Logic (LTL) is widely used for specifying temporal behaviors in discrete systems but lacks support for realtime reasoning. Constraint LTL over clocks (CLTLoc) extends LTL to real-time systems, yet it does not address optimization. To bridge this gap, we propose Optimization Constraint LTL over clocks (OCLTLoc), an extension of CLTLoc that enables the modeling and solving of real-time optimization problems with real-time temporal constraints. This paper presents the syntax and semantics of OCLTLoc. It introduces the optimal ratio problem for OCLTLoc specifications, and shows its decidability through reduction to the optimal ratio problem for Double Priced Timed Automata (DPTA). The paper also introduces a practical encoding of the OCLTLoc optimal ratio problem into Optimization Modulo Theories (OMT), which is implemented in our prototype tool, LiTeLLab ( L inear T emporal L ogic Lab oratory). Real-world-inspired case studies in scheduling demonstrate the tool’s ability to compute optimal solutions, and the effectiveness of LiTeLLab in carrying out optimization tasks for real-time specifications.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Computational Logic
Published
2026-11-16
DOI
https://doi.org/10.1145/3849799
Primary Topic
Formal Methods in Verification
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Logic-based Specification and Solving of Optimization Problems with Real-Time Constraints

Mohammad Mehdi Pourhashem Kallehbasti, Matteo Rossi
ACM Transactions on Computational Logic
Formal Methods in Verification
article

Logic-based Specification and Solving of Optimization Problems with Real-Time Constraints

Mohammad Mehdi Pourhashem Kallehbasti, Matteo Rossi
article en

Abstract

Linear Temporal Logic (LTL) is widely used for specifying temporal behaviors in discrete systems but lacks support for realtime reasoning. Constraint LTL over clocks (CLTLoc) extends LTL to real-time systems, yet it does not address optimization. To bridge this gap, we propose Optimization Constraint LTL over clocks (OCLTLoc), an extension of CLTLoc that enables the modeling and solving of real-time optimization problems with real-time temporal constraints. This paper presents the syntax and semantics of OCLTLoc. It introduces the optimal ratio problem for OCLTLoc specifications, and shows its decidability through reduction to the optimal ratio problem for Double Priced Timed Automata (DPTA). The paper also introduces a practical encoding of the OCLTLoc optimal ratio problem into Optimization Modulo Theories (OMT), which is implemented in our prototype tool, LiTeLLab ( L inear T emporal L ogic Lab oratory). Real-world-inspired case studies in scheduling demonstrate the tool’s ability to compute optimal solutions, and the effectiveness of LiTeLLab in carrying out optimization tasks for real-time specifications.

ACM Transactions on Computational Logic
University of Science and Technology of Mazandaran (IR), Politecnico di Milano (IT)
Formal Methods in Verification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon