Abstract
Inspired by P systems initiated by Gheorghe Pãun, we study a computation model over a multiset of communicating objects. The objects in our model are instances of finite automata. They interact with each other by firing external transitions between two objects. Our model, called a service automaton, is intended to specify, at a high level, a service provided on top of network devices abstracted as communicating objects. We formalize the concept of processes, running over a multiset of objects, of a service automaton and study the computing power of both single-process and multiprocess service automata. In particular, in the multiprocess case, regular maximal parallelism is defined for inter-process synchronization. It turns out that single-process service automata are equivalent to vector addition systems and hence can define nonregular processes. Among other results, we also show that Presburger reachability problem for single-process service automata is decidable, while it becomes undecidable in the multiprocess case. Hence, multiprocess service automata can not be effectively simulated by vector addition systems.
Similar content being viewed by others
References
Balanescu T, Cowling AJ, Georgescu H, Gheorghe M, Holcombe M, Vertan C (1999) Communicating stream X-machines systems are no more than X-machines. J Univers Comput Sci 5(9):494–507
Cardelli L, Gordon AD (1998) Mobile ambients. In: Proceedings of the first international conference on foundations of software science and computation structure (FoSSaCS’98). Lecture Notes in Computer Science, vol 1378. Springer, pp 140–155
Cardelli L, Ghelli G, Gordon AD (2000) Ambient groups and mobility types. In: Proceedings of the international conference IFIP on theoretical computer science, exploring new frontiers of theoretical informatics (TCS’00). Lecture Notes in Computer Science, vol 1872. Springer, pp 333–347
Caro GD, Dorigo M (1998) Two ant colony algorithms for best-effort routing in datagram networks. In: Proceedings of the tenth IASTED international conference on parallel and distributed computing and systems (PDCS’98), ISCA, pp 541–546
Carriero N, Gelernter D (1989) Linda in context. Commun ACM 32(4):444–458
Dang Z, Ibarra OH (2005) On one-membrane P systems operating in sequential mode. Int J Found Comput Sci 16(5):867–881
Di Marzo Serugendo G, Muhugusa M, Tschudin CF (1998) A survey of theories for mobile agents. World Wide Web 1(3):139–153
Dorigo M, Caro GD (1999) The ant colony optimization meta-heuristic. In: New ideas in optimization. McGraw-Hill, London, pp 11–32
Dorigo M, Gambardella LM (1997) Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53–66
Eilenberg S (1974) Automata, languages and machines, vol A. Academic Press, New York
Ginsburg S, Spanier E (1966) Semigroups, Presburger formulas, and languages. Pac J Math 16:285–296
Harel D (1987) Statecharts: a visual formalism for complex systems. Sci Comput Program 8(3):231–274
Ibarra OH, Yen H-C, Dang Z (2005) On various notions of parallelism in p systems. Int J Found Comput Sci 16(4):683–705
Kefalas P, Eleftherakis G, Kehris E (2003) Communicating X-machines: from theory to practice. In: Proceedings of the 8th Panhellenic conference on informatics (PCI’01). Lecture Notes in Computer Science, vol 2563. Springer, pp 321–341
Lohmann N, Massuthe P, Wolf K (2007) Operating guidelines for finite-state services. In Proceedings of the 28th international conference on applications and theory of petri nets and other models of concurrency (ICATPN’07). Lecture Notes in Computer Science, vol 4564. Springer, pp 321–341
Lynch NA, Tuttle MR (1989) An introduction to input/output automata. CWI Q 2(3):219–246
Pãun Gh (2000) Computing with membranes. J Comput Syst Sci 61(1):108–143
Pãun Gh (2004) Introduction to membrane computing. See P systems. http://ppage.psystems.eu/
Satyanarayanan M (2001) Pervasive computing: vision and challenges. IEEE Personal Commun 8(4):10–17
Sun (2007) Java remote method invocation. http://www.java.sun.com/j2se/1.4.2/docs/guide/rmi/
Verlan S, Bernardini F, Gheorghe M, Margenstern M (2008) Generalized communicating P systems. Theor Comput Sci 404(1–2):170–184
Wang Y (2007) Clustering, grouping, and process over networks. PhD thesis, Washington State University
Weiser M (1991) The computer for the 21st century. Sci Am 265(3):66–75
Xie G, Dang Z, Ibarra OH (2003) A solvable class of quadratic diophantine equations with applications to verification of infinite state systems. In: Proceedings of the 30th international colloquium on automata, languages and programming (ICALP’03). Lecture Notes in Computer Science, vol 2719. Springer, pp 668–680
Yang L, Dang Z, Ibarra OH (2007) Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing. In: Proceedings of the 6th international conference on unconventional computation (UC’07). Lecture Notes in Computer Science, vol 4618. Springer, pp 226–241
Acknowledgments
The authors would like to thank the anonymous referees for their useful comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yang, L., Wang, Y. & Dang, Z. Automata and processes on multisets of communicating objects. Nat Comput 9, 865–887 (2010). https://doi.org/10.1007/s11047-010-9206-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11047-010-9206-0