Toggle Main Menu Toggle Search

Open Access padlockePrints

Temporal Logic Verification of Stochastic Systems Using Barrier Certificates

Lookup NU author(s): Pushpak Jagtap, Dr Sadegh SoudjaniORCiD



This is the authors' accepted manuscript of a conference proceedings (inc. abstract) that has been published in its final definitive form by Springer Verlag, 2018.

For re-use rights please refer to the publisher's terms and conditions.


© 2018, Springer Nature Switzerland AG. 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.

Publication metadata

Author(s): Jagtap P, Soudjani S, Zamani M

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: ATVA 2018: International Symposium on Automated Technology for Verification and Analysis

Year of Conference: 2018

Pages: 177-193

Online publication date: 30/09/2018

Acceptance date: 07/10/2018

Date deposited: 04/11/2019

ISSN: 0302-9743

Publisher: Springer Verlag


DOI: 10.1007/978-3-030-01090-4_11

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783030010898