Abstract
We concentrate on a family of discrete event systems obtained from
a simple modular design principle that include in a controlled way
primitives to deal with concurrency, decisions, synchronization,
blocking, and bulk movements of jobs. Due to the functional complexity
of such systems, reliable throughput approximation algorithms must
be deeply supported on a structure based decomposition technique.
We present two complementary decomposition techniques and a fixed-point
search iterative process based on response time preservation of subsystems.
An extensive battery of numerical experiments has shown that the
error is less than 3%, and that the state space is usually reduced
by more than one order of magnitude.
Users
Please
log in to take part in the discussion (add own reviews or comments).