Title :
Modeling complex systems by a set of interacting finite-state models
Author_Institution :
Comput. Sci. Dept., Louisiana State Univ., Baton Rouge, LA, USA
Abstract :
We present here a new way of modelling a complex system by a number of finite-state components which work together by transferring control among them in a fashion similar to the usual function-calls, including recursive calls. This gives us a simpler modelling technique than statecharts, which are often too complex for general users. The new technique also helps to keep the number of states small as in statecharts. We define the semantics of an interacting family of finite-state models in terms of their behavior-trees. As an elegant application of finite-state modelling, we present a maximally efficient controller design for a tree-structured set of tasks in a reactive system by taking advantage of the common computations among the tasks.
Keywords :
finite state machines; optimising compilers; program control structures; tree data structures; behavior-trees; complex system modeling; finite-state models; function-calls; recursive calls; statecharts; tree-structured task; Application software; Automatic control; Buildings; Communication system control; Computer science; Design optimization; Software design; Software testing;
Conference_Titel :
Software Engineering Conference, 2003. Tenth Asia-Pacific
Print_ISBN :
0-7695-2011-1
DOI :
10.1109/APSEC.2003.1254392