Login / Signup
Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata.
Alistair Stewart
Kousha Etessami
Mihalis Yannakakis
Published in:
J. ACM (2015)
Keyphrases
</>
asynchronous circuits
model checking
verification method
upper bound
temporal logic
finite state machines
formal specification
objective function
automated verification
lower bound
dynamic programming
artificial intelligence
multi agent systems
timed automata