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)
Communication and Concurrency
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
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
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
Numerical analysis of superposed GSPNs
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Modular State Level Analysis of Distributed Systems Techniques and Tool Support
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
A Toolbox for the Analysis of Discrete Event Dynamic Systems
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Iterative Decomposition and Aggregation of Labeled GSPNs
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Efficient Reachability Set Generation and Storage Using Decision Diagrams
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Kronecker Algebra and (Stochastic) Petri Nets: Is It Worth the Effort?
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
A Toolbox for Functional and Quantitative Analysis of DEDS
TOOLS '98 Proceedings of the 10th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems
Future Generation Computer Systems - Systems performance analysis and evaluation
Saturation for a General Class of Models
IEEE Transactions on Software Engineering
Efficient symbolic state-space construction for asynchronous systems
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Hi-index | 0.00 |
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 pre-processing 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.