| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 1060 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. |
||||||
|
Dublin Core Export
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Ţiţchiev (Camerzan), I.I.</dc:creator> <dc:date>2010-01-05</dc:date> <dc:description xml:lang='en'>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.</dc:description> <dc:source>Computer Science Journal of Moldova 52 (1) 60-69</dc:source> <dc:title>Determining best-case and worst-case times of unknown paths in time workflow nets</dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>
|
|
|
