An efficient symbolic elimination algorithm for the stochastic process algebra tool CASPA

9Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

CASPA is a stochastic process algebra tool for performance and dependability modelling, analysis and verification. It is based entirely on the symbolic data structure MTBDD (multi-terminal binary decision diagram) which enables the tool to handle models with very large state space. This paper focuses on an extension of CASPA's modelling language by weighted immediate actions. We discuss the pertaining semantics and present an efficient symbolic algorithm for the elimination of vanishing states. A non-trivial case study illustrates the usage features of CASPA, from graphical model specification to numerical analysis. © Springer-Verlag Berlin Heidelberg 2009.

Cite

CITATION STYLE

APA

Bachmann, J., Riedl, M., Schuster, J., & Siegle, M. (2009). An efficient symbolic elimination algorithm for the stochastic process algebra tool CASPA. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5404 LNCS, pp. 485–496). https://doi.org/10.1007/978-3-540-95891-8_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free