The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete) (Logical Methods in Computer Science, 2025)