On the Power of Non-Observable Actions in Timed Automata.
Béatrice BérardPaul GastinAntoine PetitPublished in: STACS (1996)
Keyphrases
- timed automata
- model checking
- reachability analysis
- theorem prover
- power consumption
- theorem proving
- decision theoretic
- first order logic
- neural network
- real time systems
- goal directed
- machine learning
- graphical models
- computational power
- website
- multiple agents
- electric vehicles
- power distribution
- artificial intelligence