| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 1058 2 |
| Ultima descărcare din IBN: 2017-04-28 12:04 |
| Căutarea după subiecte similare conform CZU |
| 004.052 (4) |
| Computer science and technology. Computing. Data processing (4270) |
 SM ISO690:2012TITCHIEV, 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 | ||||||
|
||||||
| CZU: 004.052 | ||||||
| Pag. 60-69 | ||||||
|
||||||
 Descarcă PDF |
||||||
| 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. |
||||||
|
Google Scholar Export
<meta name="citation_title" content="Determining best-case and worst-case times of unknown paths in time workflow nets"> <meta name="citation_author" content="Titchiev Inga"> <meta name="citation_publication_date" content="2010/01/05"> <meta name="citation_journal_title" content="Computer Science Journal of Moldova"> <meta name="citation_volume" content="52"> <meta name="citation_issue" content="1"> <meta name="citation_firstpage" content="60"> <meta name="citation_lastpage" content="69"> <meta name="citation_pdf_url" content="https://ibn.idsi.md/sites/default/files/imag_file/Determining%20best_case%20and%20worst_case%20times%20of%20unknown%20paths%20in%20time%20workflow%20nets.pdf">
|
|
|
