paper-with-me

Papers

Optimization-Based Model Checking and Trace Synthesis for Complex STL Specifications

2024-08-13 · Sota Sato, Jie An, Zhenya Zhang, Ichiro Hasuo

We present a bounded model checking algorithm for signal temporal logic (STL) that exploits mixed-integer linear programming (MILP). A key technical element is our novel MILP encoding of the STL semantics; it follows the idea of stable partitioning from the recent work on SMT-based STL model checking. Assuming that our (continuous-time) system models can be encoded to MILP -- typical examples are rectangular hybrid automata (precisely) and hybrid dynamics with closed-form solutions (approximately) -- our MILP encoding yields an optimization-based model checking algorithm that is scalable, is anytime/interruptible, and accommodates parameter mining. Experimental evaluation shows our algorithm's performance advantages especially for complex STL formulas, demonstrating its practical relevance e.g. in the automotive domain.

📄 PDF Abstract BibTeX arXiv:2408.06983

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Computing unsatisfiable cores for LTLf specifications

2022-03-09 · Marco Roveri, Claudio Di Ciccio, Chiara Di Francescomarino, Chiara Ghidini

Linear-time temporal logic on finite traces (LTLf) is rapidly becoming a de-facto standard to produce specifications in many application domains (e.g., planning, business process management, run-time monitoring, reactive…

Management

Model Checking Strategies from Synthesis Over Finite Traces

2023-05-15 · Suguman Bansal, Yong Li, Lucas Martinelli Tabajara, Moshe Y. Vardi 외

The innovations in reactive synthesis from {\em Linear Temporal Logics over finite traces} (LTLf) will be amplified by the ability to verify the correctness of the strategies generated by LTLf synthesis tools. This motiv…

Learning Linear Temporal Specifications from Demonstrations with Uncertainty

2026-07-12 · Parastou Fahim, Constantino Lagoa, Rômulo Meira-G'oes arxiv

Learning temporal logic specifications from system demonstrations is essential for tasks such as formal verification and controller synthesis, especially in safety-critical domains. Existing approaches typically assume d…

ASP-Based Declarative Process Mining (Extended Abstract)

2022-05-04 · Francesco Chiariello, Fabrizio Maria Maggi, Fabio Patrizi

We propose Answer Set Programming (ASP) as an approach for modeling and solving problems from the area of Declarative Process Mining (DPM). We consider here three classical problems, namely, Log Generation, Conformance C…

Learning-Based Automatic Synthesis of Software Code and Configuration

2023-05-25 · Shantanu Mandal

Increasing demands in software industry and scarcity of software engineers motivates researchers and practitioners to automate the process of software generation and configuration. Large scale automatic software generati…

Program Synthesis