A distributed algorithm for GSPN reachability graph generation
From MaRDI portal
Recommendations
Cited in
(11)- Hypergraph-based parallel computation of passage time densities in large semi-Markov models
- Uniformization and hypergraph partitioning for the distributed computation of response time densities in very large Markov models
- Monotonic extensions of Petri nets: forward and backward search revisited
- A database approach to distributed state space generation
- A database approach to distributed state-space generation
- scientific article; zbMATH DE number 1262867 (Why is no real title available?)
- scientific article; zbMATH DE number 1786480 (Why is no real title available?)
- Reachability analysis based on structured representations
- Symbolic Methods for the State Space Exploration of GSPN Models
- MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters
- A work-efficient distributed algorithm for reachability analysis.
This page was built for publication: A distributed algorithm for GSPN reachability graph generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5929020)