A counting semantics for monitoring LTL specifications over finite traces

DOI10.1007/978-3-319-96145-3_29zbMath1511.68147arXiv1804.03237WikidataQ124212525 ScholiaQ124212525MaRDI QIDQ6041134

Franz Röck, Dejan Ničković, Roderick Bloem, Ezio Bartocci

Publication date: 26 May 2023

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.03237

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (3)

Incorporating monitors in reactive synthesis without paying the price ⋮ From LTL to rLTL monitoring: improved monitorability through robust semantics ⋮ SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking

This page was built for publication: A counting semantics for monitoring LTL specifications over finite traces