In: Proceedings of the 1988 IEEE International Conference on Robotics and Automation, Vol. 2, pages 1276-1281. Washington, DC: IEEE Comput. Soc. Press, 1988.
Abstract: The authors introduce a classification of sequencing problems according to the presence of nondeterminism, whether due to the structure of the problem itself (internal) or to online events (external). They develop a theory, in the context of timed Petri nets, of how repetition can be described and predicted.