Efficient algorithms for calculating the system matrix and the Kleene Star Operator for systems defined by directed acyclic graphs over dioids

E Bahalkeh - 2015 - rave.ohiolink.edu
Calculating the performance measures of a manufacturing system is of fundamental
importance in many industrial engineering problems, particularly scheduling. The max-plus …

Dual representation and its online scheduling method for event-varying DESs with capacity constraints

H Goto - International Journal of Control, 2008 - Taylor & Francis
This research focuses on event varying discrete event systems with capacity and order
constraints, and derives two state-space representations that stand for the earliest and latest …

A necessary and sufficient condition for throughput scalability of fork and join networks with blocking

Y Zeng, A Chaintreau, D Towsley, CH Xia - Proceedings of the 2016 …, 2016 - dl.acm.org
Due to emerging applications such as cloud computing and big data analytics, modern
information processing systems are growing increasingly large and complex. A critical issue …

[PDF][PDF] Evaluation of Bounds on Service Cycle Times in Acyclic Fork-Join Queueing Networks

NK Krivulin - International Journal of Computing Anticipatory …, 2001 - Citeseer
We present a new approach to get bounds on the service cycle time in acyclic forkjoin
queueing networks. The approach is based on (max,+)-algebra representation of network …

Algebraic modelling and performance evaluation of acyclic fork-join queueing networks

NK Krivulin - 2000 - Springer
Simple lower and upper bounds on service cycle times in stochastic acyclic fork-join
queueing networks are derived using a (max,+)-algebra based representation of network …

[PDF][PDF] Monotonicity properties and simple bounds on the mean cycle time in acyclic fork-join queueing networks

NK Krivulin - Recent Advances in Information Science and …, 1998 - math.spbu.ru
Abstract The (max,+)-algebra approach is applied to establish some monotonicity properties
and to get algebraic bounds on the service cycle completion times in acyclic fork-join …

On the Max-Plus Linear representation for event-varying systems with buffer and order constraints

H Goto, K Shoji, H Nagai… - 2007 IEEE International …, 2007 - ieeexplore.ieee.org
This paper extends the existent state-space representation based on max-plus algebra and
proposes a new form that can take into account both capacity and order constraints. It is …

Modelling methods based on discrete algebraic systems

H Goto - Discrete Event Simulations, Sciyo, Rijeka, Croatia, 2010 - books.google.com
A typical and significant feature of discrete event systems is that the behaviour is
noncontinuous; that is to say, events occur at discrete time instants and the values of internal …

Evaluation of Lyapunov exponent in generalized linear dynamical models of queueing networks

NK Krivulin - arXiv preprint arXiv:1212.6069, 2012 - arxiv.org
The problem of evaluation of Lyapunov exponent in queueing network analysis is
considered based on models and methods of idempotent algebra. General existence …

Оценивание скорости роста вектора состояний обобщенной линейной динамической системы со случайной матрицей

НК Кривулин - Вестник Санкт-Петербургского университета …, 2003 - cyberleninka.ru
Рассматривается стохастическая модель обобщенной линейной динамической
системы со случайной матрицей, элементы которой могут иметь произвольные …