Deciding the Value 1 Problem for Reachability in 1-Clock Decision Stochastic Timed Automata.
Nathalie BertrandThomas BrihayeBlaise GenestPublished in: QEST (2014)
Keyphrases
- timed automata
- model checking
- reachability analysis
- theorem prover
- decision making
- making decisions
- theorem proving
- decision makers
- first order logic
- decision rules
- high speed
- monte carlo
- power consumption
- state space
- stochastic programming
- decision theory
- decision process
- data sets
- stochastic optimization
- database
- knowledge base
- temporal logic
- artificial intelligence
- learning algorithm
- website
- case study
- transitive closure
- real time systems
- information retrieval
- multistage
- data mining
- markov random field