Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Determining best-case and worst-case times of unknown paths in time workflow nets
Authors: Ţiţchiev (Camerzan) Inga
– 0.17 Mb
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:
E-mail:
Fulltext
– 0.17 Mb
Contents
- A flexible navigation mechanism for complex data models
- Three models for gene assembly in ciliates: a comparison
- All proper colorings of every colorable BSTS (15)
- Convexity preserving interpolation by splines of arbitrary degree
- Determining best-case and worst-case times of unknown paths in time workflow nets
- Determination of inflexional group using P systems
- Developing a derivatives generator
