Abstract
This is the second in a series of papers on the inherent power of bounded cooperative concurrency, whereby an automaton can be in some bounded number of states that cooperate in accepting the input. In this paper we deal with the level of pushdown automata. We are interested in differencies in power of expression and in discrepencies in succinctness between variants of pda's that incorporate nondeterminism, pure parallelism and bounded cooperative concurrency. In particular, our results provide further evidence for the general observation that the latter feature provides inherent exponential power, in both upper and lower bound senses, regardless of whether or not the two former features are also present. While we use the language of statecharts to capture these features, our results are extremely robust, and hold also for bounded versions of virtually all other concurrent languages.
This paper is based on part of the M.Sc. thesis of the first-listed author [Hi], supervised by the second-listed author
This author's research was supported in part by a grant from the Gutwirth Foundation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Chandra, A.K., D. Kozen, and L. J. Stockmeyer, “Alternation”, J. Assoc. Comput. Mach. 28 (1981), 114–133.
Drusinsky, D. and D. Harel, “On the Power of Bounded Concurrency I: The Finite Automata Level”, submitted, 1989. (Preliminary version appeared as: “On the Power of Cooperative Concurrency”, Proc. Concurrency '88, Lecture Notes in Computer Science 335, Springer-Verlag, New York, 1988, pp. 74–103.)
Harel, D., “Statecharts: A Visual Formalism for Complex Systems”, Sci. of Comput. Prog. 8 (1987), 231–274.
Harel, D., “On Visual Formalisms”, Comm. Assoc. Comput. Mach. 31 (1988), 514–530.
Harel, D., “A Thesis for Bounded Concurrency”, Proc. 14th Symp. on Math. Found. of Comput. Sci., Lecture Notes in Computer Science, Vol. 379, Springer-Verlag, New York, 1989, pp. 35–48.
Harel, D., R. Rosner and M. Vardi, “On the Power of Bounded Concurrency III: Reasoning about Programs”, Proc. 5th IEEE Symp. on Logic in Computer Science, to appear, 1990.
Harrison, M. A., Introduction to Formal Language Theory, Addison-Wesley, Reading, MA, 1978.
Hirst, T., “Succinctness Results for Statecharts”, M.Sc. Thesis, Bar-Ilan University, Ramat Gan, Israel, 1989 (in Hebrew).
Hoare C.A.R., “Communicating Sequential Processes”, Comm. Assoc. Comput. Mach. 21, (1978), 666–677.
Hopcroft, J. E., and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
Ladner, R. E., R. J. Lipton and L. J. Stockmeyer, “Alternating Pushdown Automata”, Proc. 19th IEEE Symp. on Found. of Comput. Sci., 1978, pp. 92–106.
Meyer, A. R. and M. J. Fischer, “Economy of Description by Automata, Grammars, and Formal Systems”, Proc. 12th IEEE Symp. on Switching and Automata Theory, 1971, pp. 188–191.
Milner, R., A Calculus of Communicating Systems, Lecture Notes in Computer Science, Vol. 94, Springer-Verlag, New York, 1980.
Parikh, R. J., “On Context-Free Languages”, J. Assoc. Comput. Mach. 13 (1966), 570–581.
Reisig, W., Petri Nets: An Introduction, Springer-Verlag, Berlin, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hirst, T., Harel, D. (1990). On the power of bounded concurrency II: The pushdown automata level. In: Arnold, A. (eds) CAAP '90. CAAP 1990. Lecture Notes in Computer Science, vol 431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52590-4_37
Download citation
DOI: https://doi.org/10.1007/3-540-52590-4_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52590-5
Online ISBN: 978-3-540-47042-7
eBook Packages: Springer Book Archive