Temporal Logic Verification of Stochastic Systems Using Barrier Certificates

@article{Jagtap2018TemporalLV,
  title={Temporal Logic Verification of Stochastic Systems Using Barrier Certificates},
  author={Pushpak Jagtap and S. Soudjani and Majid Zamani},
  journal={ArXiv},
  year={2018},
  volume={abs/1807.00064}
}
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… Expand
Verification of Switched Stochastic Systems via Barrier Certificates
TLDR
This approach combines automata-based verification and the use of barrier certificates, and relies on decomposing the automaton associated with the negation of specification into a sequence of simpler reachability tasks and compute upper bounds for these reachability probabilities by means of common or multiple barrier certificates. Expand
Verification of Switched Stochastic Systems via Barrier Certificates*
TLDR
This approach combines automata-based verification and the use of barrier certificates, and relies on decomposing the automaton associated with the negation of specification into a sequence of simpler reachability tasks and compute upper bounds for these reachability probabilities by means of common or multiple barrier certificates. Expand
Formal Synthesis of Stochastic Systems via Control Barrier Certificates
TLDR
This article proposes the use of so-called control barrier certificate to solve simpler reachability tasks along with computing the corresponding controllers and probability bounds, and combines those controllers to obtain a hybrid control policy solving the considered problem. Expand
Formal Verification of Control Systems against Hyperproperties via Barrier Certificates
TLDR
A discretization-free approach for the formal verification of discrete-time control systems against hyperproperties, which involves decomposition of complex hyperproperties into several verification conditions by exploiting the automata-based structure corresponding to the complement of the original specifications. Expand
From Small-Gain Theory to Compositional Construction of Barrier Certificates for Large-Scale Stochastic Systems
TLDR
A systematic approach to first decompose high-level specifications into simple reachability tasks by utilizing automata corresponding to the complement of specifications and synthesize local controllers for those simpler tasks and combine them to obtain a hybrid controller that ensures satisfaction of the complex specification with some lower-bound on the probability of satisfaction. Expand
Linear Temporal Logic Satisfaction in Adversarial Environments Using Secure Control Barrier Certificates
TLDR
A dynamic programming based approach is formulated to determine a stationary defender policy that maximized the probability of satisfaction of a safe-LTL_F formula over a finite time-horizon under any stationary adversary policy. Expand
Verification and Control for Finite-Time Safety of Stochastic Systems via Barrier Functions
TLDR
This paper uses stochastic barrier functions as a means to quantity the probability that a system exits a given safe region of the state space in finite time and proposes a method for synthesizing polynomial state feedback controllers that achieve a specified probability of safety. Expand
A Barrier Function Approach to Finite-Time Stochastic System Verification and Control
TLDR
This paper uses stochastic control barrier functions as a means to quantify the probability that a system exits a given safe region of the state space in finite time and proposes a method for synthesizing polynomial state feedback controllers that achieve a specified probability of safety. Expand
Compositional Synthesis of Control Barrier Certificates for Networks of Stochastic Systems against ω-Regular Specifications
TLDR
The main objective is to synthesize switching control policies against ω-regular properties that can be described by accepting languages of deterministic Streett automata (DSA) along with providing probabilistic guarantees for the satisfaction of such specifications. Expand
Compositional Construction of Control Barrier Certificates for Large-Scale Stochastic Switched Systems
TLDR
The proposed scheme is based on a notion of so-called augmented pseudo-barrier certificates computed for each switched subsystem, using which one can compositionally synthesize state-feedback controllers for interconnected systems enforcing safety specifications over a finite-time horizon. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 36 REFERENCES
Quantitative automata model checking of autonomous stochastic hybrid systems
TLDR
This work shows that these quantitative verification problems can be reduced to computing reachability probabilities over the product of an automaton and the DTSHS under study, and quantitatively approximated by procedures over discrete-time Markov chains. Expand
Probabilistic Safety Verification of Stochastic Hybrid Systems Using Barrier Certificates
TLDR
A new barrier certificate based method is proposed which guarantees the absolute safety in a infinite time horizon that is beyond the reach of existing techniques using either statistical model checking or probabilistic reachable set computation. Expand
Automata Theory Meets Barrier Certificates: Temporal Logic Verification of Nonlinear Systems
TLDR
This work considers temporal logic verification of (possibly nonlinear) dynamical systems evolving over continuous state spaces and combines automata-based verification and the use of so-called barrier certificates to allow computational verification of dynamical Systems against temporal logic properties while avoiding explicit abstractions of the dynamics. Expand
Formal Verification and Synthesis for Discrete-Time Stochastic Systems
TLDR
An abstraction procedure is developed that maps a discrete-time stochastic system to an Interval-valued Markov Chain ( IMC) and a switch to a Bounded-parameter Markov Decision Process ( BMDP) and develops an efficient refinement algorithm that reduces the uncertainty in the abstraction. Expand
Formula-free finite abstractions for linear temporal verification of stochastic hybrid systems
TLDR
The proposed approach unifies techniques for the approximate abstraction of SHS over different classes of properties by explicitly relating the error introduced by the approximation to the distance between transition kernels of abstract and concrete models, and by propagating the error in time over the horizon of the specification. Expand
Deductive control synthesis for alternating-time logics
TLDR
This work shows that reasoning about temporal logic constraints in ATL*, an expressive branching-time logic that allows for quantification over control strategies, can be reduced effectively to reasoning about combinations of barrier certificates and Lyapunov functions. Expand
A Framework for Worst-Case and Stochastic Safety Verification Using Barrier Certificates
TLDR
This paper presents a methodology for safety verification of continuous and hybrid systems in the worst-case and stochastic settings, and computes an upper bound on the probability that a trajectory of the system reaches the unsafe set, a bound whose validity is proven by the existence of a barrier certificate. Expand
Model Checking of Safety Properties
TLDR
An analysis of safety properties is presented that enables us to prevent the doubly-exponential blow up and to use the same automaton used for model checking of general properties, replacing the search for bad cycles by a search for finite bad prefixes. Expand
FAUST 2 : Formal Abstractions of Uncountable-STate STochastic Processes
TLDR
FAUST allows refining the outcomes of the verification procedures over the concrete dt MP in view of the quantified and tunable error, which depends on the dtMP dynamics and on the given formula. Expand
Adaptive and Sequential Gridding Procedures for the Abstraction and Verification of Stochastic Processes
TLDR
A novel adaptive and sequential gridding algorithm is presented and is expected to conform to the underlying dynamics of the model and thus to mitigate the curse of dimensionality unavoidably related to the partitioning procedure. Expand
...
1
2
3
4
...