Accurate Performance Estimation for Stochastic Marked Graphs by Bottleneck Regrowing

Rodríguez, Ricardo J.; Júlvez, Jorge

doi:10.1007/978-3-642-15784-4_12

Cited by 8 publications

(7 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This article provides upper throughput bounds, which are usually closer to the real system throughput. 24,32 As future work, we aim at analysing lower throughput bounds following the same methodology. The lower throughput bounds would enhance the throughput analysis under failure, as an interval for the throughput would be provided.…”

Section: Discussionmentioning

confidence: 99%

Quantification and compensation of the impact of faults in system throughput

Rodríguez

Júlvez

Merseguer

2013

Proceedings of the Institution of Mechanical Engineers, Part O:

Self Cite

View full text Add to dashboard Cite

Performability relates the performance (throughput) and reliability of software systems whose normal behaviour may degrade due to the existence of faults. These systems, naturally modelled as Discrete Event Systems (DES) using shared resources, can incorporate Fault-Tolerant (FT) techniques to mitigate such a degradation. In this paper, compositional FT models based on Petri nets that make its sensitive performability analysis easier are proposed. Besides, two methods to compensate existence of faults are provided: an iterative algorithm to compute the number of extra resources needed, and an Integer-Linear Programming Problem (ILPP) that minimises the cost of incrementing resources and/or decrementing FT activities. The applicability of the developed methods is shown on a Petri net that models a secure database system.

show abstract

Section: Discussionmentioning

confidence: 99%

Quantification and compensation of the impact of faults in system throughput

Rodríguez

Júlvez

Merseguer

2013

Proceedings of the Institution of Mechanical Engineers, Part O:

Self Cite

View full text Add to dashboard Cite

show abstract

“…Similarly to [27], the solution of the LPP associated to a TPN model enables the location of the bottleneck subnets. The latter correspond to risk causes in the design (i.e., highest demanded hw/sw components, time-consuming interaction paths), and their identification provides useful feedback to the software engineer.…”

Section: B Related Workmentioning

confidence: 99%

“…Rodríguez and Julvez [27] propose an iterative algorithm to compute tight performance bounds for stochastic Marked Graphs (a structural PN subclass). The algorithm produces also the performance bottleneck subnet, which is determined through the solution of a LPP associated to the Petri Net model.…”

Section: B Related Workmentioning

confidence: 99%

A Min-Max Problem for the Computation of the Cycle Time Lower Bound in Interval-Based Time Petri Nets

Bernardi

Campos

2013

IEEE Trans. Syst. Man Cybern, Syst.

View full text Add to dashboard Cite

The time Petri net with firing frequency intervals (TPNF) is a modeling formalism used to specify system behavior under timing and frequency constraints. Efficient techniques exist to evaluate the performance of TPNF models based on the computation of bounds of performance metrics (e.g., transition throughput, place marking). In this paper, we propose a min-max problem to compute the cycle time of a transition under optimistic assumptions. That is, we are interested in computing the lower bound. We will demonstrate that such a problem is related to a maximization linear programming problem (LP-max) previously stated in the literature, to compute the throughput upper bound of the transition. The main advantage of the min-max problem compared to the LP-max is that, in addition to the optimal value, the optimal solutions provide useful feedback to the analyst on the system behavior (e.g., performance bottlenecks). We have implemented two solution algorithms, using CPLEX APIs, to solve the min-max problem, and have compared their performance using a benchmark of TPNF models, several of these being case studies. Finally, we have applied the min-max technique for the vulnerability analysis of a critical infrastructure, i.e., the Saudi Arabian crude-oil distribution network.Index Terms-Lagrangian relaxation, linear programming problem (LPP), min-max problem, performance bounds, time Petri net, vulnerability analysis.

show abstract

“…As a result, a task that requires an exhaustive state-space exploration becomes unachievable in a reasonable time for large systems. A way to overcome this problem is to estimate the performance by computing performance bounds (Campos and Silva 1992;Liu 1995;Rodríguez and Júlvez 2010;Rodríguez et al 2013).…”

Section: Introductionmentioning

confidence: 99%

“…The computation of lower and upper throughput bounds gives an estimation about where the real system throughput is contained and can be a good approximation to future system performance improvement plans. This paper introduces an improvement of the tool PeabraiN (Rodríguez et al 2012), which implements previously published algorithms to compute lower and upper throughput bounds (Campos and Silva 1992;Rodríguez and Júlvez 2010;Rodríguez et al 2013) in a Petri net. These algorithms intensively use linear programming (LP) techniques for which polynomial complexity algorithms exist, so they offer a good trade-off between accuracy and computational complexity.…”

Section: Introductionmentioning

confidence: 99%

A Petri net tool for software performance estimation based on upper throughput bounds

Rodríguez

2015

Autom Softw Eng

Self Cite

View full text Add to dashboard Cite

Functional and non-functional properties analysis (i.e., dependability, security, or performance) ensures that requirements are fulfilled during the design phase of software systems. However, the Unified Modelling Language (UML), standard de facto in industry for software systems modelling, is unsuitable for any kind of analysis but can be tailored for specific analysis purposes through profiling. For instance, the MARTE profile enables to annotate performance data within UML models that can be later transformed to formal models (e.g., Petri nets or timed automatas) for performance evaluation. A performance (or throughput) estimation in such models normally relies on a whole exploration of the state space, which becomes unfeasible for large systems. To overcome this issue upper throughput bounds are computed, which provide an approximation to the real system throughput with a good complexityaccuracy trade-off. This paper introduces a tool, named PeabraiN, that estimates the performance of software systems via their UML models. To do so, UML models are transformed to Petri nets where performance is estimated based on upper throughput bounds computation. PeabraiN also allows to compute other features on Petri nets, such as the computation of upper and lower marking place bounds, and to simulate using an approximate (continuous) method. We show the applicability of PeabraiN by evaluating the performance of a building closed circuit TV system.

show abstract

Accurate Performance Estimation for Stochastic Marked Graphs by Bottleneck Regrowing

Cited by 8 publications

References 17 publications

Quantification and compensation of the impact of faults in system throughput

Quantification and compensation of the impact of faults in system throughput

A Min-Max Problem for the Computation of the Cycle Time Lower Bound in Interval-Based Time Petri Nets

A Petri net tool for software performance estimation based on upper throughput bounds

Contact Info

Product

Resources

About