Dynamic Controllability and Dispatchability Relationships

摘要: An important issue for temporal planners is the ability to handle uncertainty. Recent papers have addressed question of how tell whether a network Dynamically Controllable, i.e., requirements are feasible in light uncertain durations some processes. We present fast algorithm Dynamic Controllability. also note correspondence between reduction steps and operations involved converting projections dispatchable form. This has implications complexity sparse networks.