EuDML | Browse

Page 1

Displaying 1 – 7 of 7

Sensitivity examination of the simulation result of discrete event dynamic systems with perturbation analysis.

Tamas Koltai, Juan Carlos Larrañeta, Luis Onieva, Sebastián Lozano (1994)

Qüestiió

Simulation completed with perturbation analysis provides a new approach for the optimal control of queuing network type systems. The objective of this paper is to calculate the sensitivity range of finite zero-order perturbation, that is, to determine the maximum and minimum size of perturbation within which zero-order propagation rules can be applied. By the introduction of the concept of virtual queue and first and second level no-input and full-output matrices, an algorithm is provided which...

Soluble approximation of linear systems in max-plus algebra

Katarína Cechlárová, Ray A. Cuninghame-Green (2003)

Kybernetika

We propose an efficient method for finding a Chebyshev-best soluble approximation to an insoluble system of linear equations over max-plus algebra.

Some ideas for comparison of Bellman chains

Laurent Truffet (2003)

Kybernetika

In this paper we are exploiting some similarities between Markov and Bellman processes and we introduce the main concepts of the paper: comparison of performance measures, and monotonicity of Bellman chains. These concepts are used to establish the main result of this paper dealing with comparison of Bellman chains.

Some representations for series on idempotent semirings - or how to go beyond recognizability keeping representability

Ines Klimann (2003)

Kybernetika

In this article, we compare different types of representations for series with coefficients in complete idempotent semirings. Each of these representations was introduced to solve a particular problem. We show how they are or are not included one in the other and we present a common generalization of them.

Structured redundancy for fault tolerance in state-space models and Petri nets

Christoforos N. Hadjicostis, George C. Verghese (1999)

Kybernetika

The design and implementation of systems in state form has traditionally focused on minimal representations which require the least number of state variables. However, “structured redundancy” – redundancy that has been intentionally introduced in some systematic way – can be extremely important when fault tolerance is desired. The redundancy can be used to detect and correct errors or to guarantee desirable performance despite hardware or computational failures. Modular redundancy, the traditional...

Supervisory controller design for timed-place Petri nets

Aydin Aybar, Altuğ İftar (2012)

Kybernetika

Supervisory controller design to avoid deadlock in discrete-event systems modeled by timed-place Petri nets (TPPNs) is considered. The recently introduced approach of place-stretching is utilized for this purpose. In this approach, given an original TPPN (OPN), a new TPPN, called the place-stretched Petri net (PSPN), is obtained. The PSPN has the property that its marking vector is sufficient to represent its state. By using this property, a supervisory controller design approach for TPPNs to avoid...

Sur les retardateurs

Thierry Bousch (2007)

Annales de l'I.H.P. Probabilités et statistiques

Displaying 1 – 7 of 7

Sensitivity examination of the simulation result of discrete event dynamic systems with perturbation analysis.

Soluble approximation of linear systems in max-plus algebra

Some ideas for comparison of Bellman chains

Some representations for series on idempotent semirings - or how to go beyond recognizability keeping representability

Structured redundancy for fault tolerance in state-space models and Petri nets

Supervisory controller design for timed-place Petri nets

Sur les retardateurs

Currently displaying 1 – 7 of 7