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:
CoRR (2013)
Keyphrases
</>
model checking
upper bound
temporal logic
finite state machines
verification method
lower bound
finite state
formal methods
knowledge representation
linear programming
epistemic logic
symbolic model checking
timed automata