"On-the-Fly" Solution Techniques for Stochastic Petri Nets and Extensions
IEEE Transactions on Software Engineering
Distributed and structured analysis approaches to study large and complex systems
Lectures on formal methods and performance analysis
Structured Solution of Asynchronously Communicating Stochastic Modules
IEEE Transactions on Software Engineering
Transient Analysis of Superposed GSPNs
IEEE Transactions on Software Engineering
Out-of-Core Solution of Large Linear Systems of Equations Arising from Stochastic Modelling
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Performance Evaluation: Origins and Directions
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
Integrating Synchronization with Priority into a Kronecker Representation
TOOLS '00 Proceedings of the 11th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
PRISM: Probabilistic Symbolic Model Checker
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
"On-the-fly" Soltuion Techniques for Stochastic Petri Nets and Extensions
PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
Implicit GSPN reachability set generation using decision diagrams
Performance Evaluation - Dependable systems and networks-performance and dependability symposium (DSN-PDS) 2002: Selected papers
Analysis of Markov reward models using zero-suppressed multi-terminal BDDs
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Optimization techniques for BDD-based bisimulation computation
Proceedings of the 17th ACM Great Lakes symposium on VLSI
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient symbolic state-space construction for asynchronous systems
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Performance modelling and Markov chains
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Faster SPDL model checking through property-driven state space generation
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
Symbolic partition refinement with automatic balancing of time and space
Performance Evaluation
Correctness issues of symbolic bisimulation computation for markov chains
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Sigref: a symbolic bisimulation tool box
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Symbolic model checking of stochastic systems: theory and implementation
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
| Hi-index | 0.00 |
We discuss how to describe the Markov chain underlying a generalized stochastic Petri net using Kronecker operators on smaller matrices. We extend previous approaches by allowing both an extensive type of marking-dependent behavior for the transitions and the presence of immediate synchronizations. The derivation of the results is thoroughly formalized, including the use of Kronecker operators in the treatment of the vanishing markings and the computation of impulse-based reward measures. We use our techniques to analyze a model whose solution using conventional methods would fail because of the state-space explosion. In the conclusion, we point out ideas to parallelize our approach.