Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata.
Jasper BerendsenTaolue ChenDavid N. JansenPublished in: TAMC (2009)
Keyphrases
- timed automata
- probabilistic planning
- model checking
- reachability analysis
- high cost
- theorem prover
- description logics
- theorem proving
- probabilistic model
- real time
- generative model
- expert systems
- asymptotically optimal
- expected cost
- total cost
- cost sensitive
- information theoretic
- uncertain data
- probability theory
- decision problems
- cost savings
- cost reduction
- data driven
- state space
- special case