In *Automated Technology for Verification and Analysis*, volume 11138, pages 177–193. Springer International Publishing, Cham, 2018.

Paper doi abstract bibtex

Paper doi abstract bibtex

This paper presents a methodology for temporal logic verification of discrete-time stochastic systems. Our goal is to find a lower bound on the probability that a complex temporal property is satisfied by finite traces of the system. Desired temporal properties of the system are expressed using a fragment of linear temporal logic, called safe LTL over finite traces. We propose to use barrier certificates for computations of such lower bounds, which is computationally much more efficient than the existing discretization-based approaches. The new approach is discretization-free and does not suffer from the curse of dimensionality caused by discretizing state sets. The proposed approach relies on decomposing the negation of the specification into a union of sequential reachabilities and then using barrier certificates to compute upper bounds for these reachability probabilities. We demonstrate the effectiveness of the proposed approach on case studies with linear and polynomial dynamics.

@incollection{jagtap_temporal_2018, address = {Cham}, title = {Temporal {Logic} {Verification} of {Stochastic} {Systems} {Using} {Barrier} {Certificates}}, volume = {11138}, copyright = {CC0 1.0 Universal Public Domain Dedication}, isbn = {978-3-030-01089-8 978-3-030-01090-4}, url = {http://link.springer.com/10.1007/978-3-030-01090-4_11}, abstract = {This paper presents a methodology for temporal logic verification of discrete-time stochastic systems. Our goal is to find a lower bound on the probability that a complex temporal property is satisfied by finite traces of the system. Desired temporal properties of the system are expressed using a fragment of linear temporal logic, called safe LTL over finite traces. We propose to use barrier certificates for computations of such lower bounds, which is computationally much more efficient than the existing discretization-based approaches. The new approach is discretization-free and does not suffer from the curse of dimensionality caused by discretizing state sets. The proposed approach relies on decomposing the negation of the specification into a union of sequential reachabilities and then using barrier certificates to compute upper bounds for these reachability probabilities. We demonstrate the effectiveness of the proposed approach on case studies with linear and polynomial dynamics.}, urldate = {2018-11-01TZ}, booktitle = {Automated {Technology} for {Verification} and {Analysis}}, publisher = {Springer International Publishing}, author = {Jagtap, Pushpak and Soudjani, Sadegh and Zamani, Majid}, year = {2018}, doi = {10.1007/978-3-030-01090-4_11}, pages = {177--193} }

Downloads: 0