Title :
Graph MA product systems
Author :
Romanovski, I. ; Caines, Peter E.
Author_Institution :
Dept. of Electr. & Comput. Eng., McGill Univ., Montreal, Que., Canada
Abstract :
In this paper, we introduce the notion of graph MA (GMA) product which constitutes a formal framework for the analysis of complex systems defined on graphs. The GMA product is a generalization of the multi-agent (MA) product which was introduced and developed previously. This paper contains results comparing the descriptive power of the MA product, the GMA product and the simultaneous product. It is shown that a necessary and sufficient condition given by I. Romanovski et al. (2002) for the existence of the MA supervisors can be directly applied in order to get a GMA supervisor. Several examples are given to motivate the notion of a GMA product and to illustrate the results of the paper.
Keywords :
automata theory; graph theory; interactive systems; multi-agent systems; production control; MA supervisors; complex system; descriptive power; graph MA product system; interactive system; multiagent; vector automata theory; Automata; Automatic control; Computer networks; Control system analysis; Control systems; Interactive systems; Physics computing; Pulp manufacturing; Telecommunication control; Transportation;
Conference_Titel :
American Control Conference, 2003. Proceedings of the 2003
Print_ISBN :
0-7803-7896-2
DOI :
10.1109/ACC.2003.1242504
