Averaging in LTL
From MaRDI portal
Publication:3190123
DOI10.1007/978-3-662-44584-6_19zbMath1417.68098OpenAlexW29365316MaRDI QIDQ3190123
Raj Mohan Matteplackel, Patricia Bouyer, Nicolas Markey
Publication date: 15 September 2014
Published in: CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01062173/file/avgltl.pdf
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (9)
Reasoning about Quality and Fuzziness of Strategic Behaviors ⋮ Weighted Linear Dynamic Logic ⋮ Unnamed Item ⋮ Quantitative vs. weighted automata ⋮ Unnamed Item ⋮ Quantitative Automata under Probabilistic Semantics ⋮ ``Most of leads to undecidability: failure of adding frequencies to LTL ⋮ Faster algorithms for quantitative verification in bounded treewidth graphs ⋮ Bidirectional nested weighted automata
This page was built for publication: Averaging in LTL