We present a practical guide to coding such an automaton. A solution may be found by applying the finite-state machine theory to guarantee group integrity of data. Indicators are obtained, such as the number of requests by category and the load degree of an agent in the collaborative system.Įmploying finite-state machines in data integrity problemsįull Text Available This paper explores the issue of group integrity of tuple subsets regarding corporate integrity constraints in relational databases. The paper analyzes the data sets from Collaborative Multicash Servicedesk application and performs a combined analysis in order to determine certain statistics. It builds the state diagram and presents the commands and documents transition between the collaborative systems states. It highlights the role of finite state machines in the complexity analysis and performs operations on very large virtual databases as finite state machines. There are presented the collaborative banking systems and their correspondence is done with finite state machines. Collaborative Systems – Finite State Machinesĭirectory of Open Access Journals (Sweden)įull Text Available In this paper the finite state machines are defined and formalized.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |