Skip to main content
SpringerLink
Log in

Scale-Freeness of SPA Models with Weighted Immediate Actions

  • Conference paper
Computer Performance Engineering (EPEW 2012, UKPEW 2012)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7587))

  • 749 Accesses

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.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 72.00
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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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)

    Chapter  Google Scholar 

  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. Bause, F.: No Way Out ∞ The Timeless Trap. Petri Net Newsletters 37, 4–8 (1990)

    Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  7. Bradley, J.: Semi-Markov PEPA: Modelling with Generally Distributed Actions. International Journal of Simulation 6(3-4), 43–51 (2005)

    Google Scholar 

  8. D’Argenio, P., Hermanns, H., Katoen, J.-P.: On generative parallel composition. Electr. Notes Theor. Comput. Sci. 22, 30–54 (1999)

    Article  MathSciNet  Google Scholar 

  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. Fulton, W.: Algebraic Curves. Benjamin (1969)

    Google Scholar 

  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)

    Article  Google Scholar 

  12. Hermanns, H. (ed.): Interactive Markov Chains. LNCS, vol. 2428. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  13. Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press (1996)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  15. Plotkin, G.: A structural approach to operational semantics. Journal of Logic and Algebraic Programming 60-61, 17–139 (2004)

    Article  MathSciNet  Google Scholar 

  16. Rettelbach, M.: Probabilistic Branching in Markovian Process Algebras. The Computer Journal 38(7), 590–599 (1995)

    Article  Google Scholar 

  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. 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. 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. 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. Tofts, C.: Processes with probabilities, priority and time. Formal Aspects of Computing 6, 536–564 (1994), doi:10.1007/BF01211867

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of the Federal Armed Forces Munich, Germany

    Johann Schuster & Markus Siegle

Authors
  1. Johann Schuster
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Markus Siegle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Ludwig-Maximilians-Universität, München, Germany

    Mirco Tribastone

  2. School of Informatics, Informatics Forum, The University of Edinburgh, 10 Crichton Street, EH8 9AB, Edinburgh, UK

    Stephen Gilmore

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schuster, J., Siegle, M. (2013). Scale-Freeness of SPA Models with Weighted Immediate Actions. In: Tribastone, M., Gilmore, S. (eds) Computer Performance Engineering. EPEW UKPEW 2012 2012. Lecture Notes in Computer Science, vol 7587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36781-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36781-6_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36780-9

  • Online ISBN: 978-3-642-36781-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation