Advertisement

Scale-Freeness of SPA Models with Weighted Immediate Actions

  • Johann Schuster
  • Markus Siegle
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7587)

Abstract

Whenever a process algebra uses weights for specifying probabilities, it is desirable that the rescaling of a submodel’s weights by a constant factor does not affect the resulting overall model. A classical weighted approach, which is independent of rescaling weights in submodels, is the WSCCS approach by Tofts. The stochastic process algebra CASPA also uses weights, but the results are in general not independent of rescaling the submodels’ weights. This paper develops necessary and sufficient criteria for CASPA models to be independent of rescalings. In addition to the general notion of scale-freeness, weaker notions that do not regard vanishing states or target on certain measures are also considered.

Keywords

stochastic process algebra scale-free CASPA nondeterminism 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ajmone Marsan, M., Balbo, G., Conte, G., Donatelli, S., Franceschinis, G.: Modelling with Generalized Stochastic Petri Nets. Wiley Series in Parallel Computing (1995)Google Scholar
  2. 2.
    Bachmann, J., Riedl, M., Schuster, J., Siegle, M.: An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA. In: Nielsen, M., Kučera, A., Miltersen, P.B., Palamidessi, C., Tůma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 485–496. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  3. 3.
    Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P.: Model-checking algorithms for continuous-time Markov chains. IEEE Transactions on Software Engineering 29(7) (2003)Google Scholar
  4. 4.
    Bause, F.: No Way Out ∞ The Timeless Trap. Petri Net Newsletters 37, 4–8 (1990)Google Scholar
  5. 5.
    Bernardo, M., Gorrieri, R.: A Tutorial on EMPA: A Theory of Concurrent Processes with Nondeterminism, Priorities, Probabilities and Time. Theoretical Computer Science 202(1-2), 1–54 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Blom, S., Haverkort, B., Kuntz, M., van de Pol, J.: Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking. Electron. Notes Theor. Comput. Sci. 220, 35–50 (2008)CrossRefGoogle Scholar
  7. 7.
    Bradley, J.: Semi-Markov PEPA: Modelling with Generally Distributed Actions. International Journal of Simulation 6(3-4), 43–51 (2005)Google Scholar
  8. 8.
    D’Argenio, P., Hermanns, H., Katoen, J.-P.: On generative parallel composition. Electr. Notes Theor. Comput. Sci. 22, 30–54 (1999)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Eisentraut, C., Hermanns, H., Zhang, L.: On probabilistic automata in continuous time. In: Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, pp. 342–351. IEEE Computer Society (2010)Google Scholar
  10. 10.
    Fulton, W.: Algebraic Curves. Benjamin (1969)Google Scholar
  11. 11.
    Hayden, R., Bradley, J., Clark, A.: Performance specification and evaluation with Unified Stochastic Probes and fluid analysis. IEEE Transactions on Software Engineering 39(1), 97–118 (2013)CrossRefGoogle Scholar
  12. 12.
    Hermanns, H. (ed.): Interactive Markov Chains. LNCS, vol. 2428. Springer, Heidelberg (2002)zbMATHGoogle Scholar
  13. 13.
    Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press (1996)Google Scholar
  14. 14.
    Kuntz, M., Siegle, M., Werner, E.: Symbolic Performance and Dependability Evaluation with the Tool CASPA. In: Núñez, M., Maamar, Z., Pelayo, F.L., Pousttchi, K., Rubio, F. (eds.) FORTE 2004. LNCS, vol. 3236, pp. 293–307. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  15. 15.
    Plotkin, G.: A structural approach to operational semantics. Journal of Logic and Algebraic Programming 60-61, 17–139 (2004)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Rettelbach, M.: Probabilistic Branching in Markovian Process Algebras. The Computer Journal 38(7), 590–599 (1995)CrossRefGoogle Scholar
  17. 17.
    Riedl, M., Schuster, J., Siegle, M.: Recent extensions to the stochastic process algebra tool CASPA. In: 5th International Conference on the Quantitative Evaluation of SysTems (QEST 2008), pp. 113–114. IEEE Computer Society (2008)Google Scholar
  18. 18.
    Schuster, J.: Towards faster numerical solution of Continuous Time Markov Chains stored by symbolic data structures. PhD thesis, Universität der Bundeswehr München (2011)Google Scholar
  19. 19.
    Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (1995)Google Scholar
  20. 20.
    Teruel, E., Franceschinis, G., De Pierro, M.: Clarifying the priority specification of GSPN: Detached priorities. In: Proceedings of the 8th International Workshop on Petri Nets and Performance Models (PNPM 1999), pp. 114 –123. IEEE Computer Society (1999)Google Scholar
  21. 21.
    Tofts, C.: Processes with probabilities, priority and time. Formal Aspects of Computing 6, 536–564 (1994), doi:10.1007/BF01211867zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Johann Schuster
    • 1
  • Markus Siegle
    • 1
  1. 1.University of the Federal Armed Forces MunichGermany

Personalised recommendations