Abstract
In contrast to their reliable and lossy-error counterparts whose termination problems are either undecidable or non-primitive recursive, the termination problem for counter machines with incrementing errors is shown to be PSpace-hard but remains solvable in ExpSpace. This is a notable decrease in complexity over that of insertion-error channel systems (with emptiness testing) whose termination problem is known to be non-elementary. Furthermore, by fixing the number of available counters, we obtain a tight NLogSpace-complete bound for the termination problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Abdulla, P.A., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using forward reachability analysis for verification of lossy channel systems. Form. Methods Syst. Des. 25(1), 39–65 (2004)
Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Inf. Comput. 127(2), 91–101 (1996)
Bouyer, P., Markey, N., Ouaknine, J., Schnoebelen, P., Worrell, J.: On termination and invariance for faulty channel machines. Form. Asp. Comput. 24(4), 595–607 (2012)
Cécé, G., Finkel, A., Iyer, S.P.: Unreliable channels are easier to verify than perfect channels. Inf. Comput. 124(1), 20–31 (1996)
Chambart, P., Schnoebelen, P.: The ordinal recursive complexity of lossy channel systems. In: 2008 23rd Annual IEEE Symposium on Logic in Computer Science, pp. 205–216. IEEE (2008)
Demri, S., Lazić, R.: LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log. (TOCL) 10(3), 16 (2009)
Hampson, C.: Two-dimensional modal logics with difference relations. Ph.D. thesis, King’s College London (2016)
Hampson, C., Kurucz, A.: Undecidable propositional bimodal logics and one-variable first-order linear temporal logics with counting. ACM Trans. Comput. Log. (TOCL) 16(3), 27:1–27:36 (2015)
Immerman, N.: Nondeterministic space is closed under complementation. SIAM J. Comput. 17(5), 935–938 (1988)
Jones, N.D.: Space-bounded reducibility among combinatorial problems. J. Comput. Syst. Sci. 11(1), 68–85 (1975)
Mayr, R.: Undecidable problems in unreliable computations. Theor. Comput. Sci. 297(1–3), 337–354 (2003)
Minsky, M.L.: Computation. Prentice-Hall, Englewood Cliffs (1967)
Ouaknine, J., Worrell, J.: On the decidability and complexity of metric temporal logic over finite words. Log. Methods Comput. Sci. 3(1) (2007)
Ouaknine, J., Worrell, J.: On the decidability of metric temporal logic. In: 20th Annual IEEE Symposium on Logic in Computer Science (LICS 2005), pp. 188–197. IEEE (2005)
Ouaknine, J., Worrell, J.: On metric temporal logic and faulty turing machines. In: Aceto, L., Ingólfsdóttir, A. (eds.) FoSSaCS 2006. LNCS, vol. 3921, pp. 217–230. Springer, Heidelberg (2006). https://doi.org/10.1007/11690634_15
Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4(2), 177–192 (1970)
Schmitz, S.: Complexity hierarchies beyond elementary. ACM Trans. Comput. Theory (TOCT) 8(1), 3:1–3:36 (2016)
Schnoebelen, P.: Revisiting Ackermann-hardness for lossy counter machines and reset petri nets. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 616–628. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15155-2_54
Szelepcsényi, R.: The method of forced enumeration for nondeterministic automata. Acta Informatica 26(3), 279–284 (1988)
Acknowledgements
I would like to thank the anonymous referees for their helpful and invaluable suggestions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Hampson, C. (2019). On the Termination Problem for Counter Machines with Incrementing Errors. In: Filiot, E., Jungers, R., Potapov, I. (eds) Reachability Problems. RP 2019. Lecture Notes in Computer Science(), vol 11674. Springer, Cham. https://doi.org/10.1007/978-3-030-30806-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-30806-3_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-30805-6
Online ISBN: 978-3-030-30806-3
eBook Packages: Computer ScienceComputer Science (R0)