Abstraction based reachability analysis for finite branching stochastic hybrid systems

In this paper, we address the problem of computing the probability of reaching a desired set in a subclass of stochastic hybrid systems, wherein the stochasticity arises from the randomness of the initial distribution of continuous states, and the probabilistic transitions in the underlying finite s...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	2017 ACM IEEE 8th International Conference on Cyber Physical Systems (ICCPS) s. 121 - 130
Hlavní autoři:	Zhang, Wenji, Prabhakar, Pavithra, Natarajan, Balasubramaniam
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	New York, NY, USA ACM 18.04.2017
Edice:	ACM Other Conferences
Témata:	abstraction based analysis Computational modeling Cyber-physical systems generalized probabilistic transition system infinite state markov chain Markov processes Partitioning algorithms Probabilistic logic reachability Reachability analysis Software and its engineering > Software organization and properties > Software functional properties > Formal methods stochastic hybrid system Theory of computation > Logic > Abstraction Theory of computation > Logic > Automated reasoning Theory of computation > Logic > Verification by model checking Theory of computation > Models of computation > Probabilistic computation generalized probabilistic transition system abstraction based analysis infinite state Markov chain reachability stochastic hybrid system
ISBN:	9781450349659, 145034965X
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!