Probably on Time and within Budget: On Reachability in Priced Probabilistic Timed Automata.
Jasper BerendsenDavid N. JansenJoost-Pieter KatoenPublished in: QEST (2006)
Keyphrases
- timed automata
- model checking
- reachability analysis
- theorem prover
- bayesian networks
- state space
- first order logic
- theorem proving
- temporal logic
- posterior probability
- information theoretic
- probabilistic model
- artificial neural networks
- information systems
- databases
- website
- decision making
- data mining
- probabilistic reasoning
- probabilistic logic
- probabilistic approaches
- real world
- neural network