Efficient Decomposition Algorithm for Stationary Analysis of Complex Stochastic Petri Net Models

DOI10.1007/978-3-319-39086-4_17zbMath1346.68138OpenAlexW2506677820MaRDI QIDQ2822659

Vince Molnár, András Vörös, Attila Klenik, Miklós Telek, István Majzik, Kristóf Marussy

Publication date: 4 October 2016

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-39086-4_17

zbMATH Keywords

stochastic Petri netsnumerical algorithmssymbolic methodsstationary analysisblock Kronecker decomposition

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Uses Software

• PRISM
• SMART_

Cites Work

• Ten Years of Saturation: A Petri Net Perspective
• Model checking of probabilistic and nondeterministic systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models
• Validation of Stochastic Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient Decomposition Algorithm for Stationary Analysis of Complex Stochastic Petri Net Models