Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
On finite-state approximants for probabilistic computation tree logic
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
Automatica (Journal of IFAC)
A Bayesian Approach to Model Checking Biological Systems
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Verification and Control of Hybrid Systems: A Symbolic Approach
Verification and Control of Hybrid Systems: A Symbolic Approach
On the connections between PCTL and dynamic programming
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Verification of discrete time stochastic hybrid systems: A stochastic reach-avoid decision problem
Automatica (Journal of IFAC)
Quantitative automata model checking of autonomous stochastic hybrid systems
Proceedings of the 14th international conference on Hybrid systems: computation and control
Adaptive Gridding for Abstraction and Verification of Stochastic Hybrid Systems
QEST '11 Proceedings of the 2011 Eighth International Conference on Quantitative Evaluation of SysTems
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Regularization of bellman equations for infinite-horizon probabilistic properties
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
Results on approximate model-checking of Stochastic Hybrid Systems (SHS) against general temporal specifications lead to abstractions that structurally depend on the given specification or with a state cardinality that crucially depends on the size of the specification. In order to cope with the associated issues of generality and scalability, we propose a specification-free abstraction approach that is general, namely it allows constructing a single abstraction to be then used for a whole cohort of problems. It furthermore computationally outperforms specification-dependent abstractions over linear temporal properties, such as bounded LTL (BLTL). 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. The new technique is compared over a case study to related results in the literature.