Determining best-case and worst-case times of unknown paths in time workflow nets
Close
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
1067 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 (4286)
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.

Crossref XML Export

<?xml version='1.0' encoding='utf-8'?>
<doi_batch version='4.3.7' xmlns='http://www.crossref.org/schema/4.3.7' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.crossref.org/schema/4.3.7 http://www.crossref.org/schema/deposit/crossref4.3.7.xsd'>
<head>
<doi_batch_id>ibn-2791</doi_batch_id>
<timestamp>1719918527</timestamp>
<depositor>
<depositor_name>Information Society Development Instiute, Republic of Moldova</depositor_name>
<email_address>[email protected]</email_address>
</depositor>
</head>
<body>
<journal>
<journal_metadata>
<full_title>Computer Science Journal of Moldova</full_title>
<issn media_type='print'>15614042</issn>
</journal_metadata>
<journal_issue>
<publication_date media_type='print'>
<year>2010</year>
</publication_date>
<issue>1(52)</issue>
</journal_issue>
<journal_article publication_type='full_text'><titles>
<title>Determining best-case and worst-case times of unknown paths in time workflow nets</title>
</titles>
<contributors>
<person_name sequence='first' contributor_role='author'>
<given_name>Inga</given_name>
<surname>Ţiţchiev (Camerzan)</surname>
</person_name>
</contributors>
<publication_date media_type='print'>
<year>2010</year>
</publication_date>
<pages>
<first_page>60</first_page>
<last_page>69</last_page>
</pages>
</journal_article>
</journal>
</body>
</doi_batch>