2014/07/08 by Paul Hunter, Hunter, Paul
Computer Science · #Computability, Logic, AI Algorithms #Distributed systems and fault tolerance #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #cs.LO
paper · pdf · doi:10.48550/arxiv.1407.1996
openalex publication_date 2014/07/08 · arxiv created 2014/07/18 · arxiv updated 2014/07/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider the reachability problem on transition systems corresponding to succinct one-counter machines, that is, machines where the counter is incremented or decremented by a value given in binary.