Determining best-case and worst-case times of unknown paths in time workflow nets

摘要

In this paper we present a method aimed for determining best-case and worst-case times between two arbitrary states in a time workflow net. The method uses a discrete subset of the state space of the time workflow net and archives the results, which are integers.