Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
A Complete System of B-Rational Identities
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Finding all essential terms of a characteristic maxpolynomial
Discrete Applied Mathematics
Methods and Applications of Interval Analysis (SIAM Studies in Applied and Numerical Mathematics) (Siam Studies in Applied Mathematics, 2.)
Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks
Performance Evaluation
The DISCO network calculator: a toolbox for worst case analysis
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Optimal routing for end-to-end guarantees: the price of multiplexing
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
An Algorithmic Toolbox for Network Calculus
Discrete Event Dynamic Systems
Computation of a (min,+) multi-dimensional convolution for end-to-end performance analysis
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Conjugate network calculus: A dual approach applying the Legendre transform
Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
COINC library: a toolbox for the network calculus: invited presentation, extended abstract
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
NC-maude: a rewriting tool to play with network calculus
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Flow control with (min,+) algebra
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Brief Model reference control for timed event graphs in dioids
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
Based on the (min,+)-linear system theory, the work developed here takes the set membership approach as a starting point in order to obtain a container for ultimately pseudo-periodic functions representative of Discrete Event Dynamic Systems. Such a container, by approximating the exact system, ensures to entirely include it in a guaranteed way. To reach that point, the container introduced in this paper is given as an interval, the bounds of which are a convex function for the upper approximation and a concave function for the lower approximation. Thanks to the characteristics of the bounds, the aim is both to reduce data storage (that can be very high when exact functions are handled) and to reduce the algorithm complexity of the operations of sum, inf-convolution and subadditive closure. These operations are integrated into inclusion functions, the algorithms of which are of linear or quasi-linear complexity.