Safety Verification for Probabilistic Hybrid Systems

Zhang, Lijun; She, Zhikun; Ratschan, Stefan; Hermanns, Holger; Hahn, Ernst Moritz

doi:10.3166/ejc.18.572-587

Cited by 42 publications

(32 citation statements)

References 29 publications

(65 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This considerably differs from related work on Stochastic Hybrid systems (with deterministic continuous behaviour), where mostly over-approximation [17], [18], [19] is used to compute results. The practical applicability of these approaches, however, seems to be limited to special cases.…”

Section: Introductionmentioning

confidence: 87%

Survivability Evaluation of Fluid Critical Infrastructures Using Hybrid Petri Nets

Ghasemieh

Remke

Haverkort

2013

2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing

View full text Add to dashboard Cite

Abstract-In this paper we propose a formal, model-checking based procedure to evaluate the survivability of fluid critical infrastructures. To do so, we introduce the Stochastic Time Logic (STL), which allows to precisely express intricate state-based and until-based properties for an important class of hybrid Petri nets. We present an efficient model checking procedure which recursively traverses the underlying state-space of the hybrid Petri net model, and identifies those regions (subsets of the discrete-continuous state space) that satisfy STL formulae. A case study studying the survivability of a water refinery and distribution plant shows the feasibility of our approach.

show abstract

Section: Introductionmentioning

confidence: 87%

Survivability Evaluation of Fluid Critical Infrastructures Using Hybrid Petri Nets

Ghasemieh

Remke

Haverkort

2013

2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing

View full text Add to dashboard Cite

show abstract

“…We also mention briefly two alternative methods. In [32], a "symbolic" search through the state space using non-probabilistic methods is performed first, after which a finite-state Markov decision process is constructed and analysed. Instead, [13,10] uses stochastic satisfiability modulo theories to permit the verification of bounded properties.…”

Section: Probabilistic Rectangular Hybrid Automatamentioning

confidence: 99%

Verification and Control of Probabilistic Rectangular Hybrid Automata

Sproston

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Hybrid systems are characterised by a combination of discrete and continuous components. In many application areas for hybrid systems, such as vehicular control and systems biology, stochastic behaviour is intrinsic. This has led to the development of stochastic extensions of formalisms, such as hybrid automata, for the modelling of hybrid systems, together with their associated verification and controller synthesis algorithms, in order to allow reasoning about quantitative properties such as "the vehicle's speed will reach 50kph within 10 seconds with probability at least 0.99". We consider probabilistic rectangular hybrid automata, which generalise the well-known class of rectangular hybrid automata with the possibility of representing random behavior of the discrete components of the system, permitting the modeling of the likelihood of faults, choices in randomised algorithms and message losses. We highlight the differences between verification and control problems for probabilistic rectangular hybrid automata and the corresponding problems for non-probabilistic rectangular hybrid automata. Furthermore, we will describe the effect of assumptions on the underlying model of time (discrete or continuous) on the considered verification and control problems. Finally, we will also consider how probabilistic rectangular hybrid automata can be used as abstract models for more general classes of stochastic hybrid systems.

show abstract

“…Due to the partitioning of the state-space into regions with the same characteristics, we are able to provide exact results for time-bounded reachability within few seconds. This considerably differs from related work on Stochastic Hybrid systems (with deterministic continuous behaviour), where mostly overapproximation [76,87,88] is used to compute results. The practical applicability of these approaches, however, seems to be limited to special cases.…”

Section: Related Workmentioning

confidence: 90%

“…Abstraction techniques, for obtainining over approximation for probabilities of specific properties, are proposed for the restricted class of probabilistic timed automata [11], and safty verification of probabilistic hybrid automata [88]. This resembles to what we did when analysing hybrid Petri nets with PTTs.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Analysis of hybrid petri nets with random discrete events

Ghasemieh¹

View full text Add to dashboard Cite

Safety Verification for Probabilistic Hybrid Systems

Cited by 42 publications

References 29 publications

Survivability Evaluation of Fluid Critical Infrastructures Using Hybrid Petri Nets

Survivability Evaluation of Fluid Critical Infrastructures Using Hybrid Petri Nets

Verification and Control of Probabilistic Rectangular Hybrid Automata

Analysis of hybrid petri nets with random discrete events

Contact Info

Product

Resources

About