RO  EN
IMCS/Publications/CSJM/Issues/CSJM v.18, n.1 (52), 2010/

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

Authors: Ţiţchiev (Camerzan) Inga

Abstract

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.

State University of Tiraspol
E-mail:

Fulltext

Adobe PDF document0.17 Mb