A service composition model based on finite state automata

Yuncheng Jiang · Caai Transactions on Intelligent Systems · 2006

The existing conditions and problems of service computing are analyzed,and based on the work of D Berardi and A Wombacher,a kind of finite state automata with condition cFSA(Finite State Automata with condition)is presented,and the service theory model based on cFSA is presented too.Based on this model,the formal theory model of service composition based on finite state automata with condition cFSA is studied.The algebraic property and implementing method of the service composition model are studied.

Read the paper · More papers on PaperTik