SMT-based Searching for k-quasi-optimal Runs in Weighted Timed Automata.

Bozena Wozna-Szczesniak Agnieszka M. Zbrzezny Andrzej Zbrzezny

Published in: CS&P (2015)

Keyphrases

timed automata
artificial intelligence
low cost
optimal design
weighted sum
model checking
optimal solution
dynamic programming
worst case
machine learning
graphical models
first order logic
case study
search strategies
knowledge base
information systems
statistical machine translation
learning algorithm