Symbolic computation of maximal probabilistic reachability

DOI10.1007/3-540-44685-0_12MaRDI QIDQ4791267zbMATH OpenFDO

Authors Marta Kwiatkowska, Gethin Norman, Jeremy Sproston

Publication date 6 February 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2154/21540169.htm

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• State explosion in almost-sure probabilistic reachability
• Ensuring completeness of symbolic verification methods for infinite-state systems
• Validation of Stochastic Systems
• Symbolic model checking for probabilistic processes
• Reachability analysis of probabilistic systems by successive refinements

Cited in

(7)

• Syntactic partial order compression for probabilistic reachability
• Symbolic model checking for probabilistic timed automata
• Parameter synthesis for probabilistic timed automata using stochastic game abstractions
• Approximate Symbolic Reachability of Networks of Transition Systems
• Computing minimum and maximum reachability times in probabilistic systems
• State explosion in almost-sure probabilistic reachability
• Performance analysis of probabilistic timed automata using digital clocks

This page was built for publication: Symbolic computation of maximal probabilistic reachability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4791267)