Proceedings, Volumes 1-2IEEE, 1996 - Artificial intelligence |
From inside the book
Results 1-3 of 15
Page 51
... firing t ' ; the token capacity C ( Ta , Tb ) between two transition subsets T , and T is the maximum number of firings of transitions in T. from mo without firing ones in T. To make it easier to define or calculate the token ca ...
... firing t ' ; the token capacity C ( Ta , Tb ) between two transition subsets T , and T is the maximum number of firings of transitions in T. from mo without firing ones in T. To make it easier to define or calculate the token ca ...
Page 154
... firing t11 or t1 and we leave this state by firing t2 ; or toi . By firing t2 , we lead to a forbidden state and by firing toi , we go to a low risk state . We associate the procedure with t1i , tai and ti Procedure_ti START if ( m ) ...
... firing t11 or t1 and we leave this state by firing t2 ; or toi . By firing t2 , we lead to a forbidden state and by firing toi , we go to a low risk state . We associate the procedure with t1i , tai and ti Procedure_ti START if ( m ) ...
Page 155
... firing ts ; or t3 . By firing t3 , we lead to a forbidden state and by firing tsi , we go to a low risk state . We associate the procedure with t2 , and ts . No procedure will be associated to tsi - 1 and 16-1 to keep independent ...
... firing ts ; or t3 . By firing t3 , we lead to a forbidden state and by firing tsi , we go to a low risk state . We associate the procedure with t2 , and ts . No procedure will be associated to tsi - 1 and 16-1 to keep independent ...
Contents
Intelligent HumanMachine Systems in a Modern Communication Infrastructure | 1 |
SESSION TU4AScheduling | 16 |
Rescheduling Method based on Distributed Cooperative Problem Solving Model | 35 |
Copyright | |
29 other sections not shown
Other editions - View all
Common terms and phrases
agents algorithm application approach assignment Automated Manufacturing Systems Automation behavior buffer component Computer configuration considered constraints control system cost data link layer deadlines deadlock defined device under test distributed due dates dynamic environment evaluation evolutionary algorithm example execution feature fieldbus Figure flexible frequency function Genetic Algorithm global heuristic holarchy holons IEEE implementation input integration intelligent interaction learning logical controller machine macroaction manipulator Manufacturing Systems messages method Mimetism model checking monitoring nodes object optimal output paper parameters performance Petri net Petri nets phase PID control placement planning plant priority inversion problem processor Profibus proposed protocol real-time resource robot robot cell scheduling semaphore sensor sequence server shown signal simulation solution solve specific stage station structure supervisor task techniques telerobotic Theorem tion token torque transition vector vibration