Abstract
A class of infinite-state automata with a simple periodic behaviour and a convenient graphical representation is studied. A positive one-counter circuit is defined as a strongly connected onecounter net (one-counter nondeterministic finite automata without zero-testing) with at least one positive cycle. It is shown that in a positive circuit an infinite part of a reachability set is an arithmetic progression; numerical properties of this progression are estimated. A specific graphical representation of circuits is presented. General one-counter nets are equivalent to Petri Nets with at most one unbounded place and to pushdown automata with a single-symbol stack alphabet. It is shown that an arbitrary one-counter net can be represented by a finite tree of circuits. A one-counter net is called sound, if a counter is used only for “infinite-state” (periodic) behaviour. It is shown that for an arbitrary one-counter net an equivalent sound net can be effectively constructed from the corresponding tree of circuits.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abdulla, P.A. and Čerans, K., Simulation is decidable for one-counter nets, in: CONCUR’98 Concurrency Theory, Sangiorgi, D. and Simone, R., Eds., Lecture Notes Compt. Sci., 1998, vol. 1466, pp. 253–268.
Bashkin, V.A., On the single-periodic representation of reachability in one-counter nets, in Concurrency, Specification, and Programming (CS&P 2009), Czaja, L. and Szczuka, M., Eds., Warsaw: Warsaw Univ., 2009, pp. 60–71.
Brauer, A., On a problem of partitions, Am. J. Mathem., 1942, vol. 64, pp. 299–312.
Erdös, P. and Graham, R.L., On a linear diophantine problem of Frobenius, Acta Arithmetica, 1972, vol. 21, pp. 399–408.
Göller, S., Haase, C., Ouaknine, J., and Worrell, J., Model checking succinct and parametric one-counter automata, in: Automata, Languages, and Programming, Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., and Spirakis, P., Eds., Lecture Notes Compt. Sci., 2010, vol. 6199, pp. 575–586.
Göller, S., Mayr, R., and To, A.W., On the computational complexity of verifying one-counter processes, Proc. 2009 24th Annual IEEE Symp. on Logic in Computer Science, LICS’09, IEEE Computer Society, Washington, 2009.
Jančar, P., Kučera, A., Moller, F., and Sawa, Z., DP lower bounds for equivalence-checking and model-checking of one-counter automata, Information and Computation, 2004, vol. 188, pp. 1–19.
Kučera, A., Efficient verification algorithms for one-counter processes, in Automata, Languages, and Programming, Montanari, U., Rolim, J.D., and Welzl, E., Eds., Lecture Notes Compt. Sci., 2000, vol. 1853, pp. 317–328.
Kuzmin, E.V. and Chalyy, D.Ju., On the reachability set of automaton counter machines, Autom. Control Compt. Sci., 2011, vol. 45, pp. 444–451.
Liubicz, U.I., Bounds for the optimal determinization of nondeterministic autonomic automata, Sibir. Matem. J., 1964, no. 2, pp. 337–355.
Serre, O., Parity games played on transition graphs of one-counter processes, in Foundations of Software Science and Computation Structures, Aceto, L. and Ingölfsdöttir, A., Eds., Lecture Notes Compt. Sci., 2006, vol. 3921, pp. 337–351.
Sylvester, J. J., Question 7382, Mathematical questions with their solutions, Educ. Times, 1884, vol. 41, p. 21.
Tarjan, R., Depth-first search and linear graph algorithms, SIAM J. Compt., 1972, vol. 1, pp. 146–160.
Author information
Authors and Affiliations
Corresponding author
Additional information
The article is published in the original.
This research is partially supported by Russian Fund for Basic Research.
About this article
Cite this article
Bashkin, V.A. On the efficient modeling of unbounded resource by one-counter circuits. Aut. Control Comp. Sci. 48, 564–574 (2014). https://doi.org/10.3103/S0146411614070189
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411614070189