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 service automata, 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 are strictly more powerful than single-process service 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
Cardelli, L., Ghelli, G., Gordon, A.: Types for the ambient calculus (2002)
Cardelli, L., Ghelli, G., Gordon, A.D.: Ambient groups and mobility types. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol. 1872, pp. 333–347. Springer, Heidelberg (2000)
Cardelli, L., Gordon, A.D.: Mobile ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378. Springer, Heidelberg (1998)
Caro, G.D., Dorigo, M.: 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 1998), pp. 541–546 (1998)
Carriero, N., Gelernter, D.: Linda in context. Commun. ACM 32(4), 444–458 (1989)
Dang, Z., Ibarra, O.H.: On one-membrane P systems operating in sequential mode. Int. J. Found. Comput. Sci. 16(5), 867–881 (2005)
Dorigo, M., Caro, G.D.: The ant colony optimization meta-heuristic. In: New Ideas in Optimization, pp. 11–32. McGraw-Hill, London (1999)
Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)
Ginsburg, S., Spanier, E.: Semigroups, presburger formulas, and languages. Pacific J. of Mathematics. 16, 285–296 (1966)
Ibarra, O.H., Yen, H., Dang, Z.: On various notions of parallelism in P Systems. Int. J. Found. Comput. Sci. 16(4), 683–705 (2005)
Lohmann, N., Massuthe, P., Wolf, K.: Operating guidelines for finite-state services. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 321–341. Springer, Heidelberg (2007)
Lynch, N.A., Tuttle, M.R.: An introduction to input/output automata. CWI-Quarterly 2(3), 219–246 (1989)
Pãun, Gh.: Introduction to membrane computing. See P Systems Web Page, http://psystems.disco.unimib.it
Pãun, Gh.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000)
Satyanarayanan, M.: Pervasive computing: vision and challenges. IEEE Personal Communications 8(4), 10–17 (2001)
Di Marzo Serugendo, G., Muhugusa, M., Tschudin, C.F.: A survey of theories for mobile agents. World Wide Web 1(3), 139–153 (1998)
Sun. Java remote method invocation (2007), http://java.sun.com/j2se/1.4.2/docs/guide/rmi/
Wang, Y.: Clustering, grouping, and process over networks. PhD thesis, Washington State University (2007)
Weiser, M.: The computer for the 21st century. Scientific American 265(3), 66–75 (1991)
Xie, G., Dang, Z., Ibarra, O.H.: A solvable class of quadratic Diophantine equations with applications to verification of infinite state systems. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 668–680. Springer, Heidelberg (2003)
Yang, L., Dang, Z., Ibarra, O.H.: Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing. In: Akl, S.G., Calude, C.S., Dinneen, M.J., Rozenberg, G., Wareham, H.T. (eds.) UC 2007. LNCS, vol. 4618, pp. 226–241. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, L., Wang, Y., Dang, Z. (2008). Automata on Multisets of Communicating Objects. In: Calude, C.S., Costa, J.F., Freund, R., Oswald, M., Rozenberg, G. (eds) Unconventional Computing. UC 2008. Lecture Notes in Computer Science, vol 5204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85194-3_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-85194-3_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85193-6
Online ISBN: 978-3-540-85194-3
eBook Packages: Computer ScienceComputer Science (R0)