Cyclic Steady State Refinement: Multimodal Processes Perspective
The cyclic scheduling problem modeled in terms of Cyclic Concurrent Process Systems is considered. The problem can be seen as a kind of Diophantine problem, hence its solvability, i.e. schedulability, plays a pivotal role in many supply-chain problems. In contradiction to the traditionally offered solutions the approach proposed allows one to take into account such behavioral features as transient periods and deadlocks occurrence. So, the contribution’s aim is the modeling framework enabling an evaluation of cyclic scheduling problems solvability, i.e., the declarative approach to reachability problems regarding cyclic steady states determination as well as conditions guaranteeing assumed performance of multimodal processes executed within a concurrent cyclic processes environment.
Keywordscyclic processes multimodal process state space periodicity dispatching rules
- 4.Fournier, O., Lopez, P., Lan Sun Luk, J.-D.: Cyclic scheduling following the social behavior of ant colonies. In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, pp. 450–454 (2002)Google Scholar
- 7.Polak, M., Majdzik, P., Banaszak, Z., Wójcik, R.: The performance evaluation tool for automated prototyping of concurrent cyclic processes. In: Skowron, A. (ed.) Fundamenta Informaticae, vol. 60(1-4), pp. 269–289. ISO Press (2004)Google Scholar
- 9.Wójcik, R.: Constraint programming approach to designing conflict-free schedules for repetitive manufacturing processes. In: Cunha, P.F., Maropoulos, P.G. (eds.) Digital Enterprise Technology. Perspectives and Future Challenges, pp. 267–274. Springer (2007)Google Scholar