Amin Soltanieh
Abstract
This paper presents an algorithm for determining the unknown rates in the sequential processes of a Stochastic Process Algebra (SPA) model, provided that the rates in the combined flat model are given. Such a rate lifting is useful for model reverse engineering and model repair. Technically, the algorithm works by solving systems of nonlinear equations and – if necessary – adjusting the model’s synchronisation structure, without changing its transition system. The adjustments cause an augmentation of a transition’s context and thus enable additional control over the transition rate. The complete pseudo-code of the rate lifting algorithm is included and discussed in the paper, and its practical usefulness is demonstrated by two case studies. The approach taken by the algorithm exploits some structural and behavioural properties of SPA systems, which are formulated here for the first time and could be very beneficial also in other contexts, such as compositional system verification.
- C. Baier, B. R. Haverkort, H. Hermanns, and J.-P. Katoen. 2003. Model-Checking Algorithms for Continuous-Time Markov Chains. IEEE Trans. Software Eng. 29, 6 (2003), 524–541. https://doi.org/10.1109/TSE.2003.1205180Google Scholar
Digital Library
- E. Bartocci, R. Grosu, P. Katsaros, C. R. Ramakrishnan, and S.A. Smolka. 2011. Model Repair for Probabilistic Systems. In Tools and Algorithms for the Construction and Analysis of Systems. Springer, LNCS 6605, 326–340.Google ScholarCross Ref
- M. Bernardo. 1999. Theory and Application of Extended Markovian Process Algebra. Ph. D. Dissertation. University of Bologna.Google Scholar
- C. Cai, J. Sun, G. Dobbie, Z. Hóu, H. Bride, J. Dong, and S. Lee. 2022. Fast Automated Abstract Machine Repair Using Simultaneous Modifications and Refactoring. Form. Asp. Comput. 34, 2 (2022), 8:1–8:31.Google Scholar
- T. Chen, E.M. Hahn, T. Han, M. Kwiatkowska, H. Qu, and L. Zhang. 2013. Model Repair for Markov Decision Processes. In 2013 International Symposium on Theoretical Aspects of Software Engineering. 85–92.Google Scholar
- C. Dehnert, S. Junges, J.-P. Katoen, and M. Volk. 2017. A Storm is Coming: A Modern Probabilistic Model Checker. In Computer Aided Verification, R. Majumdar and V. Kunčak (Eds.). Springer, LNCS 10427, Cham, 592–600.Google Scholar
- N. Götz. 1994. Stochastische Prozessalgebren: Integration von funktionalem Entwurf und Leistungsbewertung Verteilter Systeme. Ph. D. Dissertation. University of Erlangen-Nuremberg, Germany. http://d-nb.info/941439879Google Scholar
- A. Gouberman, M. Siegle, and B.S.K. Tati. 2019. Markov chains with perturbed rates to absorption: Theory and application to model repair. Performance Evaluation 130 (2019), 32–50. https://doi.org/10.1016/j.peva.2018.11.006Google ScholarDigital Library
- M. Grau-Sanchez, A. Grau, and M. Noguera. 2011. On the computational efficiency index and some iterative methods for solving systems of nonlinear equations. J. Comput. Appl. Math. 236, 6 (2011), 1259–1266.Google ScholarDigital Library
- H. Hermanns, U. Herzog, and J.-P. Katoen. 2002. Process algebra for performance evaluation. Theoretical Computer Science 274, 1 (2002), 43–87. https://doi.org/10.1016/S0304-3975(00)00305-4Google ScholarDigital Library
- J. Hillston. 1996. A Compositional Approach to Performance Modelling. Cambridge University Press, New York, NY, USA.Google ScholarDigital Library
- O. Ibe and K. Trivedi. 1990. Stochastic Petri Net Models of Polling Systems. IEEE Journal on Selected Areas in Communications 8, 9(1990), 1649–1657.Google ScholarDigital Library
- Gurobi Optimization, Inc. [n. d.]. Gurobi, Version 9.5, 2022. https://www.gurobi.comGoogle Scholar
- The MathWorks, Inc. [n. d.]. Matlab, Version R2022a, 2022. https://www.mathworks.comGoogle Scholar
- Wolfram Research, Inc. [n. d.]. Mathematica, Version 12.2.0.0. https://www.wolfram.com/mathematica Champaign, IL, 2021.Google Scholar
- M. Kuntz, M. Siegle, and E. Werner. 2004. Symbolic Performance and Dependability Evaluation with the Tool CASPA. In Applying Formal Methods: Testing, Performance and M/E Commerce: FORTE 2004 Workshops, European Performance Engineering Workshop. Springer, LNCS 3236, 293–307.Google Scholar
- M. Kwiatkowska, G. Norman, and D. Parker. 2011. PRISM 4.0: Verification of Probabilistic Real-time Systems. In Proc. 23rd International Conference on Computer Aided Verification (CAV’11)(LNCS, Vol. 6806). Springer, 585–591.Google Scholar
- J. M. Martínez. 1994. Algorithms for Solving Nonlinear Systems of Equations. In Algorithms for Continuous Optimization: The State of the Art, Emilio Spedicato (Ed.). Springer Netherlands, 81–108.Google Scholar
- J. Meyer. 1980. On Evaluating the Performability of Degradable Computing Systems. IEEE Trans. Comput. C-29, 8 (1980), 720–731. https://doi.org/10.1109/TC.1980.1675654Google ScholarDigital Library
- R. Milner. 1980. A Calculus of Communicating Systems. Springer, LNCS 92.Google Scholar
- S. Pathak, E. Ábrahám, N. Jansen, A. Tacchella, and J.-P. Katoen. 2015. A Greedy Approach for the Efficient Repair of Stochastic Models. In NASA Formal Methods, K. Havelund, G. Holzmann, and R. Joshi (Eds.). Springer, LNCS 9058, Cham, 295–309.Google Scholar
- PRISM. [n. d.]. Cyclic Server Polling System CTMC case study athttps://www.prismmodelchecker.org/casestudies/polling.php. https://www.prismmodelchecker.org/casestudies/polling.php Accessed on Sept. 14, 2023.Google Scholar
- J. R. Sharma, R. K. Guha, and R. Sharma. 2013. An efficient fourth order weighted-Newton method for systems of nonlinear equations. Numerical Algorithms 62(2013), 307–323.Google ScholarDigital Library
- M. Siegle and A. Soltanieh. 2022. Rate Lifting for Stochastic Process Algebra – Exploiting Structural Properties –. In Quantitative Evaluation of Systems, E. Ábrahám and M. Paolieri (Eds.). Springer, LNCS 13479, Cham, 67–84.Google Scholar
- K. Sikorski. 1985. Optimal solution of nonlinear equations. Journal of Complexity 1, 2 (1985), 197–209.Google ScholarCross Ref
- A. Soltanieh. 2022. Compositional Stochastic Process Algebra Models: A Focus on Model Repair and Rate Lifting. Ph. D. Dissertation. Universität der Bundeswehr München, Dept. of Computer Science.Google Scholar
- A. Soltanieh and M. Siegle. 2020. It Sometimes Works: A Lifting Algorithm for Repair of Stochastic Process Algebra Models. In Measurement, Modelling and Evaluation of Computing Systems. Springer, LNCS 12040, 190–207.Google Scholar
- A. Soltanieh and M. Siegle. 2021. Solving Systems of Bilinear Equations for Transition Rate Reconstruction. In Fundamentals of Software Engineering, H. Hojjat and M. Massink (Eds.). Springer, LNCS 12818, Cham, 157–172.Google Scholar
- B.S.K. Tati and M. Siegle. 2016. Rate Reduction for State-labelled Markov Chains with Upper Time-bounded CSL Requirements. In Proceedings Cassting Workshop onGames for the Synthesis of Complex Systems and 3rd International Workshop onSynthesis of Complex Parameters, Eindhoven, The Netherlands, April 2-3, 2016(Electronic Proceedings in Theoretical Computer Science, Vol. 220), T. Brihaye, B. Delahaye, L. Jezequel, N. Markey, and J. Srba (Eds.). Open Publishing Association, 77–89. https://doi.org/10.4204/EPTCS.220.7Google ScholarCross Ref
- H. Wang, D.I. Laurenson, and J. Hillston. 2008. Evaluation of RSVP and Mobility-Aware RSVP using Performance Evaluation Process Algebra. In IEEE International Conference on Communications (ICC). IEEE, 192–197.Google Scholar
Index Terms
- Rate Lifting for Stochastic Process Algebra by Transition Context Augmentation
Recommendations
Rate Lifting for Stochastic Process Algebra – Exploiting Structural Properties –
Quantitative Evaluation of SystemsAbstractThis paper presents an algorithm for determining the unknown rates in the sequential processes of a Stochastic Process Algebra (SPA) model, provided that the rates in the combined flat model are given. Such a rate lifting is useful for model ...
A fluid analysis framework for a Markovian process algebra
Markovian process algebras, such as PEPA and stochastic @p-calculus, bring a powerful compositional approach to the performance modelling of complex systems. However, the models generated by process algebras, as with other interleaving formalisms, are ...
Giving a net semantics to Markovian process algebra
PNPM '95: Proceedings of the Sixth International Workshop on Petri Nets and Performance ModelsWe define two compositional net semantics for the stochastic process algebra Markovian process algebra (MPA), based on a class of stochastic Petri nets. The first semantics is operational in style and is defined by structural induction. We prove that ...
Comments