We study the reachability problem for continuous one-counter automata, COCA short. In such transitions are guarded by upper- and lower-bound tests against counter value. Additionally, updates associated with taking can be (non-deterministically) scaled down a nonzero factor between zero one. Our three main results as follows: we prove (1) that global is in NC 2 ; (2) that, general, decidable po...