Optimal proofs for linear temporal logic on lasso words

DOI10.1007/978-3-030-01090-4_3zbMath1517.68222OpenAlexW2892751950MaRDI QIDQ6109580

Dmitriy Traytel, Bhargav Nagaraja Bhatt, David A. Basin

Publication date: 28 July 2023

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-01090-4_3

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (4)

Computer says no: verdict explainability for runtime monitors using a local proof system ⋮ A survey of challenges for runtime verification from advanced application domains (beyond software) ⋮ Sampling polynomial trajectories for LTL verification ⋮ MITL verification under timing uncertainty

This page was built for publication: Optimal proofs for linear temporal logic on lasso words