Determining best-case and worst-case times of unknown paths in time workflow nets
Închide
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
996 2
Ultima descărcare din IBN:
2017-04-28 12:04
Căutarea după subiecte
similare conform CZU
004.052 (4)
Știința și tehnologia calculatoarelor. Calculatoare. Procesarea datelor (4103)
SM ISO690:2012
TITCHIEV, Inga. Determining best-case and worst-case times of unknown paths in time workflow nets. In: Computer Science Journal of Moldova, 2010, nr. 1(52), pp. 60-69. ISSN 1561-4042.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Computer Science Journal of Moldova
Numărul 1(52) / 2010 / ISSN 1561-4042 /ISSNe 2587-4330

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

Pag. 60-69

Titchiev Inga
 
Tiraspol State University
 
Disponibil în IBN: 4 decembrie 2013


Rezumat

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