Abstract
Systolic automata are models of highly-concurrent language acceptors based on identical processors with one-way flow of information, amenable to efficient hardware implementation as multiprocessor chips.
In this paper we investigate the relationship between Binary Systolic Tree Automata (BSTA), in which the underlying communication structure is an infinite complete binary tree with parallel bottom-up computation, and P systems, a biologically-inspired formalism based on rewrite rules acting upon multisets of symbols with a maximally-parallel semantics.
In particular, we propose a variant of BSTA as multiset languages acceptors, termed Multiset BSTA. By exploiting the similarity in the parallel computation as performed in both BSTA and P systems, we show how a Multiset BSTA can be simulated by a cooperative P system while preserving the computational efficiency of systolic automata.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andrei, O., Ciobanu, G., Lucanu, D.: A rewriting logic framework for operational semantics of membrane systems. Theoretical Computer Science 373(3), 163–181 (2007)
Barbuti, R., Caravagna, G., Maggiolo-Schettini, A., Milazzo, P.: P systems with endosomes. International Journal of Computers, Communications and Control 4(3), 214–223 (2009)
Barbuti, R., Maggiolo-Schettini, A., Milazzo, P., Pardini, G.: Simulation of spatial P system models. Theoretical Computer Science 529, 11–45 (2014)
Barbuti, R., Maggiolo-Schettini, A., Milazzo, P., Pardini, G., Tesei, L.: Spatial P systems. Natural Computing 10(1), 3–16 (2011)
Barbuti, R., Maggiolo-Schettini, A., Milazzo, P., Tini, S.: Compositional semantics and behavioral equivalences for P systems. Theoretical Computer Science 395(1), 77–100 (2008)
Barbuti, R., Maggiolo-Schettini, A., Milazzo, P., Tini, S.: A P systems flat form preserving step-by-step behaviour. Fundamenta Informaticae 87(1), 1–34 (2008)
Barbuti, R., Maggiolo-Schettini, A., Milazzo, P., Tini, S.: P systems with transport and diffusion membrane channels. Fundamenta Informaticae 93(1–3), 17–31 (2009)
Barbuti, R., Maggiolo-Schettini, A., Milazzo, P., Tini, S.: Compositional semantics of spiking neural P systems. Journal of Logic and Algebraic Programming 79(6), 304–316 (2010)
Barbuti, R., Maggiolo-Schettini, A., Milazzo, P., Tini, S.: Membrane systems working in generating and accepting modes: Expressiveness and encodings. In: Gheorghe, M., Hinze, T., Păun, G., Rozenberg, G., Salomaa, A. (eds.) CMC 2010. LNCS, vol. 6501, pp. 103–118. Springer, Heidelberg (2010)
Barbuti, R., Maggiolo-Schettini, A., Milazzo, P., Tini, S.: An overview on operational semantics in membrane computing. International Journal of Foundations of Computer Science 22(1), 119–131 (2011)
Busi, N.: Using well-structured transition systems to decide divergence for catalytic P systems. Theoretical Computer Science 372(2–3), 125–135 (2007)
Csuhaj-Varjú, E., Martín-Vide, C., Mitrana, V.: Multiset Automata. In: Calude, C.S., Pun, G., Rozenberg, G., Salomaa, A. (eds.) Multiset Processing. LNCS, vol. 2235, pp. 69–83. Springer, Heidelberg (2001)
Culik II, K., Gruska, J., Salomaa, A.: On a family of L languages resulting from systolic tree automata. Theoretical Computer Science 23(3), 231–242 (1983)
Culik II, K., Gruska, J., Salomaa, A.: Systolic automata for VLSI on balanced trees. Acta Informatica 18(4), 335–344 (1983)
Culik II, K., Gruska, J., Salomaa, A.: Systolic trellis automata I. International Journal of Computer Mathematics 15(1–4), 195–212 (1984)
Culik II, K., Gruska, J., Salomaa, A.: Systolic trellis automata II. International Journal of Computer Mathematics 16(1), 3–22 (1984)
Culik II, K., Salomaa, A., Wood, D.: Systolic tree acceptors. RAIRO-Theoretical Informatics and Applications-Informatique Théorique et Applications 18(1), 53–69 (1984)
Fachini, E., Gruska, J., Maggiolo-Schettini, A., Sangiorgi, D.: Simulation of systolic tree automata on trellis automata. International Journal of Foundations of Computer Science 1(2), 87–110 (1990)
Fachini, E., Maggiolo-Schettini, A., Resta, G., Sangiorgi, D.: Nonacceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata. Theoretical Computer Science 83(2), 249–260 (1991)
Fachini, E., Maggiolo-Schettini, A., Sangiorgi, D.: Comparisons among classes of Y-tree systolic automata. In: Rovan, B. (ed.) Mathematical Foundations of Computer Science 1990. LNCS, vol. 452, pp. 254–260. Springer, Berlin Heidelberg (1990)
Fachini, E., Maggiolo-Schettini, A., Sangiorgi, D.: Classes of systolic Y-tree automata and a comparison with systolic trellis automata. Acta Informatica 29(6/7), 623–643 (1992)
Gruska, J., Monti, A., Napoli, M., Parente, D.: Succinctness of descriptions of SBTA-languages. Theoretical Computer Science 179(1–2), 251–271 (1997)
Păun, G.: Membrane Computing: An Introduction. Springer, Heidelberg (2002)
Rozenberg, G., Salomaa, A.: The mathematical theory of L systems. Academic Press (1980)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Barbuti, R., Maggiolo-Schettini, A., Milazzo, P., Pardini, G., Tini, S. (2014). Systolic Automata and P Systems. In: Calude, C., Freivalds, R., Kazuo, I. (eds) Computing with New Resources. Lecture Notes in Computer Science(), vol 8808. Springer, Cham. https://doi.org/10.1007/978-3-319-13350-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-13350-8_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13349-2
Online ISBN: 978-3-319-13350-8
eBook Packages: Computer ScienceComputer Science (R0)