Login / Signup

Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata.

Alistair StewartKousha EtessamiMihalis Yannakakis
Published in: CAV (2013)
Keyphrases
  • model checking
  • upper bound
  • temporal logic
  • finite state machines
  • verification method
  • finite state
  • lower bound
  • dynamic programming
  • artificial intelligence
  • objective function