Necessary and Sufficient Ergodicity Condition for Open Synchronized Queueing Networks
IEEE Transactions on Software Engineering
Performance analysis and optimization of asynchronous circuits
Performance analysis and optimization of asynchronous circuits
Introduction to Algorithms
Performance Analysis and Optimization of Asynchronous Circuits
ICCS '94 Proceedings of the1994 IEEE International Conference on Computer Design: VLSI in Computer & Processors
Performance Bounds for Stochastic Timed Petri Nets
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Structural techniques and performance bounds of stochastic Petri net models
Advances in Petri Nets 1992, The DEMON Project
ASYNC '97 Proceedings of the 3rd International Symposium on Advanced Research in Asynchronous Circuits and Systems
Accelerating Markovian Analysis of Asynchronous Systems using String- based State Compression
ASYNC '98 Proceedings of the 4th International Symposium on Advanced Research in Asynchronous Circuits and Systems
Bounding Average Time Separations of Events in Stochastic Timed Petri Nets with Choice
ASYNC '99 Proceedings of the 5th International Symposium on Advanced Research in Asynchronous Circuits and Systems
Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
IEEE Transactions on Software Engineering
Scheduling Synchronous Elastic Designs
ACSD '09 Proceedings of the 2009 Ninth International Conference on Application of Concurrency to System Design
Automating Data-Throttling Analysis for Data-Intensive Workflows
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Measuring the effectiveness of throttled data transfers on data-intensive workflows
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
Hi-index | 0.00 |
The adequate system performance is usually a critical requirement to be checked during the verification phase of a system. Thus, accurately measuring the performance of current industrial systems, which are often modelled as a Discrete Event Systems (DES), is a need. Due to the state explosion problem, the performance evaluation of DES becomes increasingly difficult as the size of the systems increases. Some approaches, such as the computation of performance bounds, have been developed to overcome this problem. In this paper we propose a new method to produce performance bounds that are sharper than the ones that can be achieved with current methods. The core of our method is an iterative algorithm that initially considers the most constraining bottleneck cycle of the system and adds other cycles to it in each iteration. The proposed method is deeply explained and then applied to a broad set of Marked Graphs.