Communication and concurrency
An implementation of an efficient algorithm for bisimulation equivalence
Science of Computer Programming
A methodology for solving Markov models of parallel systems
Journal of Parallel and Distributed Computing
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
A decomposition approach for stochastic reward net models
Performance Evaluation
Efficient vector and parallel manipulation of tensor products
ACM Transactions on Mathematical Software (TOMS)
Numerical Analysis of Superposed GSPNs
IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
Generalized Stochastic Petri Nets: A Definition at the Net Level and its Implications
IEEE Transactions on Software Engineering
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
A Notion of Equivalence for Stochastic Petri Nets
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Reachability Analysis Based on Structured Representations
Proceedings of the 17th International Conference on Application and Theory of Petri Nets
Superposed Generalized Stochastic Petri Nets: Definition and Efficient Solution
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
An Efficient Disk-Based Tool for Solving Very Large Markov Models
Proceedings of the 9th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
QPN-Tool for the Specification ans Analysis of Hierarchically Combined Queueing Petri Nets
MMB '95 Proceedings of the 8th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation: Quantitative Evaluation of Computing and Communication Systems
Complexity of Kronecker Operations on Sparse Matrices with Applications to the Solution of Markov Models
Efficient Computation and Representation of Large Reachability Sets for Composed Automata
Discrete Event Dynamic Systems
An iterative bounding method for stochastic automata networks
Performance Evaluation
Hierarchical Reachability Graph Generation for Petri Nets
Formal Methods in System Design
Distributed Numerical Markov Chain Analysis
Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Adaptive decomposition and approximation for the analysis of stochastic petri nets
Performance Evaluation - Dependable systems and networks-performance and dependability symposium (DSN-PDS) 2002: Selected papers
Structured analysis techniques for large Markov chains
SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
Bisimulation relations for weighted automata
Theoretical Computer Science
Product form approximations for communicating Markov processes
Performance Evaluation
Rational Automata Networks: A Non-Markovian Modeling Approach
INFORMS Journal on Computing
Hi-index | 0.01 |
Superposed Generalized Stochastic Petri Nets (SGSPNs) and Stochastic Automata Networks (SANs) are formalisms to describe Markovian models as a collection of synchronously communicating components. Both formalisms allow a compact representation of the generator matrix of the Markov chain, which can be exploited for very space efficient analysis techniques. The main drawback of the approaches is that for many models the compositional description introduces a large number of unreachable states, such that the gain due to the compact representation of the generator matrix is completely lost. This paper proposes a new approach to avoid unreachable states without losing the possibility to represent the generator matrix in a compact form. The central idea is to introduce a preprocessing step to generate a hierarchical structure which defines a block structure of the generator matrix, where every block can be represented in a compact form similar to the representation of generator matrices originally proposed for SGSPNs or SANs. The resulting structure includes no unreachable states, needs only slightly more space than the compact representation developed for SANs and can still be exploited in efficient numerical solution techniques. Furthermore, the approach is a very efficient method to generate and represent huge reachability sets and graphs.