DocumentCode :
2918572
Title :
From process transition networks to behavior automata
Author :
Shu, Hua ; Malec, Jacek
Author_Institution :
Dept. of Comput. & Inf. Sci., Linkoping Univ., Sweden
fYear :
1991
fDate :
13-15 Aug 1991
Firstpage :
257
Lastpage :
262
Abstract :
A process transition network (PTN) provides a method for specifying the behavior of multiple agents in terms of changes and interdependence among the changes of the states of individual agents. A way to compile a PTN into a more easily implemented structure is presented. A structure as such is called a behavior automaton (BA). The transformation from PTNs to BAs addresses, in a broad sense, the issues of relating the design to the implementation of an intelligent control system. With regard to the modeling of intelligent behavior, such a transformation suggests a closed loop in which the behavior specification of the concerned agents can be examined and incrementally improved by examining the validation of the PTNs. Also explored are ways in which PTNs can be used to specify behaviors at different abstraction levels
Keywords :
artificial intelligence; automata theory; closed loop systems; control system synthesis; graph theory; large-scale systems; agent state changes interdependence; behavior automata; closed loop; control system design; control system implementation; intelligent control system; multiple agent behaviour; process transition networks; Automata; Computer networks; Information science; Intelligent agent; Intelligent control; Intelligent systems; Knowledge representation; Petri nets;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Control, 1991., Proceedings of the 1991 IEEE International Symposium on
Conference_Location :
Arlington, VA
ISSN :
2158-9860
Print_ISBN :
0-7803-0106-4
Type :
conf
DOI :
10.1109/ISIC.1991.187367
Filename :
187367
Link To Document :
بازگشت