2006•Unpublished venueRequires access

Activity-Local Symbolic State Graph Generation for High-Level Stochastic Models

Kai Lampka, Markus Siegle

Open publisher page 6 citations

Abstract

Abstract. This paper introduces a new, efficient method for deriving compact symbolic representations of very large (labelled) Markov chains resulting from high-level model specifications such as stochastic Petri nets, stochastic process algebras, etc.. This so called “activity-local” scheme is combined with a new data structure, called zero-suppressed multi-terminal binary decision diagram, and a new efficient “activityoriented” scheme for symbolic reachability analysis. Several standard benchmark models from the literature are analyzed in order to show the superiority of our approach. 1

About this research paper

What this paper is about

Abstract. This paper introduces a new, efficient method for deriving compact symbolic representations of very large (labelled) Markov chains resulting from high-level model specifications such as stochastic Petri nets, stochastic process algebras, etc.. This so called “activity-local” scheme is combined with a new data structure, called zero-suppressed multi-terminal binary decision diagram, and a new efficient “activityoriented” scheme for symbolic reachability analysis. Several standard benchmark models from the literature are analyzed in order to show the superiority of our approach. 1

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract. This paper introduces a new, efficient method for deriving compact symbolic representations of very large (labelled) Markov chains resulting from high-level model specifications such as stochastic Petri nets, stochastic process algebras, etc.. This so called “activity-local” scheme is combined with a new data structure, called zero-suppressed multi-terminal binary decision diagram, and a new efficient “activityoriented” scheme for symbolic reachability analysis. Several standard benchmark models from the literature are analyzed in order to show the superiority of our approach. 1

Key concepts: Reachability, Theoretical computer science, Computer science, Symbolic data analysis, Graph, Binary decision diagram, Representation (politics), Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Activity-Local Symbolic State Graph Generation for High-Level Stochastic Models — Research Paper | ScholarLens