Skip to main content

Optimal Aggregation of Components for the Solution of Markov Regenerative Processes

  • Conference paper
  • First Online:
Quantitative Evaluation of Systems (QEST 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9826))

Included in the following conference series:

Abstract

The solution of non-ergodic Markov Renewal Processes may be reduced to the solution of multiple smaller sub-processes (components), as proposed inĀ [4]. This technique exhibits a good saving in time in many practical cases, since components solution may reduce to the transient solution of a Markov chain. Indeed the choice of the components might significantly influence the solution time, and this choice is demanded in [4] to a greedy algorithm. This paper presents a computation of an optimal set of components through a translation into an integer linear programming problem (ILP). A comparison of the optimal method with the greedy one is then presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    This logic implication is not in standard ILP form. It can be transformed [10] in ILP form as follows. Let U be a constant greater than |V|. Add a new variable \(k_{v,w}\) subject to these constraints: \(0 \le k_{v,w} \le 1\),Ā \(U k_{v,w} - U < x_v -x_w \le U k_{v,w}\) and \(\forall D' \in \varvec{\mathcal {D}}\setminus \{D\}\) add \(y^{D'}_v \le y^{D'}_w + U k_{v,w}\).

References

  1. Amparore, E.G.: A new GreatSPN GUI for GSPN editing and CSL\(^{\!\text{TA}}\) model checking. In: Norman, G., Sanders, W. (eds.) QEST 2014. LNCS, vol. 8657, pp. 170ā€“173. Springer, Heidelberg (2014)

    Google ScholarĀ 

  2. Amparore, E.G., Donatelli, S.: A component-based solution method for non-ergodic Markov regenerative processes. In: Aldini, A., Bernardo, M., Bononi, L., Cortellessa, V. (eds.) EPEW 2010. LNCS, vol. 6342, pp. 236ā€“251. Springer, Heidelberg (2010)

    ChapterĀ  Google ScholarĀ 

  3. Amparore, E.G., Donatelli, S.: MC4CSL\(^{\rm TA}\): an efficient model checking tool for CSL\(^{\rm TA}\). In: International Conference on Quantitative Evaluation of Systems, pp. 153ā€“154. IEEE Computer Society, Los Alamitos (2010)

    Google ScholarĀ 

  4. Amparore, E.G., Donatelli, S.: A component-based solution for reducible Markov regenerative processes. Perform. Eval. 70(6), 400ā€“422 (2013)

    ArticleĀ  Google ScholarĀ 

  5. Amparore, E.G., Donatelli, S.: Improving and assessing the efficiency of the MC4CSL\(^{\rm TA}\) model checker. In: Balsamo, M.S., Knottenbelt, W.J., Marin, A. (eds.) EPEW 2013. LNCS, vol. 8168, pp. 206ā€“220. Springer, Heidelberg (2013)

    ChapterĀ  Google ScholarĀ 

  6. Baarir, S., Beccuti, M., Cerotti, D., Pierro, M.D., Donatelli, S., Franceschinis, G.: The GreatSPN tool: recent enhancements. SIGMETRICS Perform. Eval. Rev. 36(4), 4ā€“9 (2009)

    ArticleĀ  Google ScholarĀ 

  7. Baier, C., Haverkort, B., Hermanns, H., Katoen, J.P.: Model-checking algorithms for continuous-time Markov chains. IEEE Trans. Softw. Eng. 29(6), 524ā€“541 (2003)

    ArticleĀ  MATHĀ  Google ScholarĀ 

  8. Bondavalli, A., Mura, I.: High-level Petri net modelling of phased mission systems. In: 10th European Workshop on Dependable Computing, pp. 91ā€“95, Vienna (1999)

    Google ScholarĀ 

  9. Bondavalli, A., Filippini, R.: Modeling and analysis of a scheduled maintenance system: a DSPN approach. Comput. J. 47(6), 634ā€“650 (2004)

    ArticleĀ  Google ScholarĀ 

  10. Brown, G.G., Dell, R.F.: Formulating integer linear programs: a roguesā€™ gallery. INFORMS Trans. Educ. 7(2), 153ā€“159 (2007)

    ArticleĀ  Google ScholarĀ 

  11. Cassandras, C.G., Lafortune, S.: Introduction to Discrete Event Systems. Springer, Secaucus (2006)

    MATHĀ  Google ScholarĀ 

  12. Donatelli, S., Haddad, S., Sproston, J.: Model checking timed and stochastic properties with CSL\(^{\rm TA}\). IEEE Trans. Softw. Eng. 35(2), 224ā€“240 (2009)

    ArticleĀ  Google ScholarĀ 

  13. German, R.: Performance Analysis of Communication Systems with Non-Markovian Stochastic Petri Nets. Wiley, New York (2000)

    MATHĀ  Google ScholarĀ 

  14. German, R.: Iterative analysis of Markov regenerative models. Perform. Eval. 44, 51ā€“72 (2001)

    ArticleĀ  MATHĀ  Google ScholarĀ 

  15. Mura, I., Bondavalli, A.: Markov regenerative stochastic petri nets to model and evaluate phased mission systems dependability. IEEE Trans. Comput. 50(12), 1337ā€“1351 (2001)

    ArticleĀ  Google ScholarĀ 

  16. Stewart, W.J.: Probability, Markov Chains, Queues, and Simulation: The Mathematical Basis of Performance Modeling. Princeton University Press, Princeton (2009)

    MATHĀ  Google ScholarĀ 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Elvio Gilberto Amparore .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Amparore, E.G., Donatelli, S. (2016). Optimal Aggregation of Components for the Solution of Markov Regenerative Processes. In: Agha, G., Van Houdt, B. (eds) Quantitative Evaluation of Systems. QEST 2016. Lecture Notes in Computer Science(), vol 9826. Springer, Cham. https://doi.org/10.1007/978-3-319-43425-4_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-43425-4_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-43424-7

  • Online ISBN: 978-3-319-43425-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics