This paper presents a theoretical basis for scheduling approaches based on purely control-flow graphs. This formulation includes a control flow graph model based on a finite discrete-time homogeneous Markov chain suitable to represent complex control structures. A probabilistic finite state machine is introduced to model the resulting schedule and evalute the effectiveness of the scheduling approaches for control flow graphs. The need of such models is imposed by the nature of real time systems in which the control sequence depends on external conditions
ITIL, change management, scheduling Change management is a disciplined process for introducing required changes onto the IT environment, with the underlying objective of minimizing disruptions to the business services as a result of performing IT changes. Currently, one of the most pressing problems in change management is the scheduling and planning of changes. Building on an earlier mathematical formulation of the change scheduling problem, in this paper we take the formulation of the problem one step further by breaking down the changes into the activities that compose them. We illustrate the theoretical viability of the approach, discuss the limit of its applicability to real life scenarios, describe heuristic techniques that promise to bridge the scalability gap and provide experimental validation for them.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.