Deriving Symbolic Representations from Stochastic Process Algebras

@inproceedings{Kuntz2002DerivingSR,
  title={Deriving Symbolic Representations from Stochastic Process Algebras},
  author={Matthias Kuntz and Markus Siegle},
  booktitle={PAPM-PROBMIV},
  year={2002}
}
A new denotational semantics for a variant of the stochastic process algebra TIPP is presented, which maps process terms to Multiterminal binary decision diagrams. It is shown that the new semantics is Markovian bisimulation equivalent to the standard SOS semantics. The paper also addresses the difficult question of keeping the underlying state space minimal at every construction step. 

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

TLDR
This paper focuses on an extension of CASPA's modelling language by weighted immediate actions, and presents an efficient symbolic algorithm for the elimination of vanishing states.

Symbolic semantics and verification of stochastic process algebras

TLDR
This thesis contributes to the alleviation of the state space explosion problem by devising a new denotational semantics for stochastic process algebras that relies on efficient data structures for the compact representation of even huge state spaces.

Symbolic Reachability for Process Algebras with Recursive Data Types

TLDR
A symbolic reachability algorithm for process algebras with recursive data types based on partitioning of the transition relation into events whose influence is local that will work for any system that consists of a fixed number of communicating processes.

Symbolic Model Checking of Stochastic Systems: Theory and Implementation

TLDR
The syntax and semantics of the new logic are defined and it is shown that IM-SPDL provides powerful means to specify path-based properties with timing restrictions and that model checking IM- SPDL can be realised efficiently in practice.

Symbolic Representations and Analysis of Large Probabilistic Systems

TLDR
This paper describes symbolic techniques for the construction, representation and analysis of large, probabilistic systems, focusing on BDDs, multi-valued decision diagrams (MDDs), multi-terminal binary decision diagrams(MTBDDs) and matrix diagrams.

Symbolic Performance and Dependability Evaluation with the Tool CASPA

TLDR
This paper describes the tool CASPA, a new performance evaluation tool which is based on a Markovian stochastic process algebra and presents several case studies which demonstrate the superiority of CASPA over sparse-matrix-based process algebra tools.

Activity-local symbolic state graph generation for high-level stochastic models

TLDR
A new, efficient method for constructing compact symbolic representations of very large stochastic labelled transition systems based on zero-suppressed binary decision diagrams which is applicable to general high-level models which do not have to possess any particular structure.

Faster SPDL Model Checking Through Property-Driven State Space Generation

TLDR
This paper proposes an approach that directly generates the reduced PTS from a given SPA specification and an SPDL path formula, and shows enormous state space reductions, at no increase in generation time.

Scalable Stochastic Modelling for Resilience

This chapter summarises techniques that are suitable for performance and resilience modelling and analysis of massive stochastic systems. We will introduce scalable techniques that can be applied to

SPDL Model Checking via Property-Driven State Space Generation

In this report we describe how both, memory and time requirements for stochastic model checking of SPDL (stochastic propositional dynamic logic) formulae can significantly be reduced. SPDL is the

References

SHOWING 1-10 OF 34 REFERENCES

Generating BDD Models for Process Algebra Terms

TLDR
This work describes how to efficiently derive the ordered Binary Decision Diagrams (BDDs) corresponding to the operational semantics of the terms of an arbitrary Simple system and introduces a useful extension of Simple providing explicit recursion.

Advances in Model Representations

We review high-level specification formalisms for Markovian performability models, thereby emphasising the role of structuring concepts as realised par excellence by stochastic process algebras.

Compositional Minimal Semantics for the Stochastic Process Algebra TIPP

TLDR
The problem of deriving the Markov chain underlying a stochastic process algebra term is addressed and a set of new semantic rules which specify the way in which process terms are translated into their corresponding matrices are proposed.

Stochastic Process Algebras - Between LOTOS and Markov Chains

Compact representation of large performability models based on extended BDDs

TLDR
Extensions of BDDs are considered, in order to represent stochastic transition systems for performabil-ity analysis and state space reduction by Markovian bisimulation, based on symbolic techniques.

Syntax , Semantics , Equivalences , and Axioms for MTIPP y

TLDR
This report presents the language together with its operational semantics, that defines Markovian labelled transition systems as a combination of classical action-oriented transition systems andMarkovian processes, especially continuous time Markov chains, and presents equational laws for the central notion of equivalence.

Compositional Representation and Reduction of Stochastic Labelled Transition Systems based on Decision Node BDDs

TLDR
It is shown how parallel composition of components can be performed in this context, without leading to state space explosion, and an entirely based on symbolic techniques enable a compositional approach to the stochastic modelling of concurrent systems.

Algebraic decision diagrams and their applications

TLDR
This paper presents a treatment founded in Boolean algebras and discusses algorithms and results in applications like matrix multiplication and shortest path algorithms, and outlines possible applications of ADD's to logic synthesis, formal verification, and testing of digital systems.

Multi Terminal Binary Decision Diagrams to Represent and Analyse Continuous Time Markov Chains

TLDR
This paper investigates the applicability of MTBDDs to the symbolic representation of continuous time Markov chains, derived from high-level formalisms, such as queueing networks or process algebras, and discusses iterative solution algorithms to compute the steady-state probability vector.