An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA

Authors:
Jens Bachmann;Martin Riedl;Johann Schuster;Markus Siegle
Affiliations:
Department of Computer Science, University of the German Federal Armed Forces Munich,;Department of Computer Science, University of the German Federal Armed Forces Munich,;Department of Computer Science, University of the German Federal Armed Forces Munich,;Department of Computer Science, University of the German Federal Armed Forces Munich,
Venue:
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Year:
2009

Citing 4
Cited 4

A compositional approach to performance modelling

A compositional approach to performance modelling
A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time

Theoretical Computer Science
Deriving Symbolic Representations from Stochastic Process Algebras

PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Symbolic model checking of stochastic systems: theory and implementation

SPIN'06 Proceedings of the 13th international conference on Model Checking Software

A view-probability-matrix approach to the modelling of gossiping protocols

ACM SIGMETRICS Performance Evaluation Review
A modelling and analysis environment for LARES

MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Scale-Freeness of SPA models with weighted immediate actions

EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
Scale-Freeness of SPA models with weighted immediate actions

EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering

Quantified Score

Hi-index	0.00

Visualization

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.