Automata on Multisets of Communicating Objects

Authors:
Linmin Yang;Yong Wang;Zhe Dang
Affiliations:
School of Electrical Engineering and Computer Science, Washington State University, Pullman, USA WA 99164;Google Inc., Mountain View, USA CA 94043;School of Electrical Engineering and Computer Science, Washington State University, Pullman, USA WA 99164
Venue:
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Year:
2008

Citing 11
Cited 0

Linda in context

Communications of the ACM
The ant colony optimization meta-heuristic

New ideas in optimization
Computing with membranes

Journal of Computer and System Sciences
A survey of theories for mobile agents

World Wide Web
Ambient Groups and Mobility Types

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Mobile Ambients

FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Clustering, grouping, and process over networks

Clustering, grouping, and process over networks
A solvable class of quadratic Diophantine equations with applications to verification of infinite-state systems

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Operating guidelines for finite-state services

ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing

UC'07 Proceedings of the 6th international conference on Unconventional Computation

Quantified Score

Hi-index	0.00

Visualization

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.