On the public citation graph

Storage alternatives for large structured state spaces

0 signed · 58 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-58152-9_15openalex-snapshot
Superposed Generalized Stochastic Petri Nets: Definition and efficient solution
inferredcites →https://doi.org/10.1007/978-1-4613-0533-0_2openalex-snapshot
Compiling Techniques for the Analysis of Stochastic Petri Nets
inferredcites →https://doi.org/10.1007/978-1-4613-8351-2_11openalex-snapshot
Automated Generation and Analysis of Markov Reward Models Using Stochastic Reward Nets
inferredcites →https://doi.org/10.1016/0166-5316(91)90003-lopenalex-snapshot
On the solution of GSPN reward models
inferredcites →https://doi.org/10.1016/0166-5316(93)90026-qopenalex-snapshot
A decomposition approach for stochastic reward net models
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1109/32.541433openalex-snapshot
Numerical analysis of superposed GSPNs
inferredcites →https://doi.org/10.1109/32.99196openalex-snapshot
Stochastic automata network of modeling parallel systems
inferredcites →https://doi.org/10.1145/288197.581193openalex-snapshot
Modelling with Generalized Stochastic Petri Nets
inferredcites →https://doi.org/10.1515/9780691223384openalex-snapshot
Introduction to the Numerical Solution of Markov Chains

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11549970_8openalex-snapshot
Bounds for Point and Steady-State Availability: An Algorithmic Approach Based on Lumpability and Stochastic Ordering
inferred← citeshttps://doi.org/10.1007/3-540-44667-2_10openalex-snapshot
Distributed and Structured Analysis Approaches to Study Large and Complex Systems⋆
inferred← citeshttps://doi.org/10.1007/3-540-44667-2_2openalex-snapshot
Markovian Models for Performance and Dependability Evaluation
inferred← citeshttps://doi.org/10.1007/3-540-44988-4_8openalex-snapshot
Efficient Symbolic State-Space Construction for Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_30openalex-snapshot
Combining Structural and Enumerative Techniques for the Validation of Bounded Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-45740-2_1openalex-snapshot
Kronecker Algebra and (Stochastic) Petri Nets: Is It Worth the Effort?
inferred← citeshttps://doi.org/10.1007/3-540-46506-5_15openalex-snapshot
Numerical Analysis Methods
inferred← citeshttps://doi.org/10.1007/3-540-48745-x_10openalex-snapshot
Parallel Approaches to the Numerical Transient Analysis of Stochastic Reward Nets
inferred← citeshttps://doi.org/10.1007/3-540-48745-x_2openalex-snapshot
Efficient Reachability Set Generation and Storage Using Decision Diagrams
inferred← citeshttps://doi.org/10.1007/3-540-49059-0_29openalex-snapshot
Modular State Level Analysis of Distributed Systems Techniques and Tool Support
inferred← citeshttps://doi.org/10.1007/978-1-4471-4276-8_17openalex-snapshot
The On-Line Diagnosis of Time Petri Nets
inferred← citeshttps://doi.org/10.1007/978-1-4757-4828-4_2openalex-snapshot
Tools for Formulating Markov Models
inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_9openalex-snapshot
Symbolic Representations and Analysis of Large Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-27793-4_2openalex-snapshot
Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?
inferred← citeshttps://doi.org/10.1007/978-3-540-45232-4_6openalex-snapshot
Logical and Stochastic Modeling with Smart
inferred← citeshttps://doi.org/10.1007/978-3-540-72522-0_1openalex-snapshot
Performance Modelling and Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-540-73094-1_10openalex-snapshot
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets
inferred← citeshttps://doi.org/10.1007/s10009-005-0188-7openalex-snapshot
The saturation algorithm for symbolic state-space exploration
inferred← citeshttps://doi.org/10.1016/j.laa.2004.01.006openalex-snapshot
Symbolic state-space exploration and numerical analysis of state-sharing composed models
inferred← citeshttps://doi.org/10.1016/j.peva.2003.07.005openalex-snapshot
Implicit GSPN reachability set generation using decision diagrams
inferred← citeshttps://doi.org/10.1016/j.peva.2004.04.002openalex-snapshot
On the benefits of using functional transitions and Kronecker algebra
inferred← citeshttps://doi.org/10.1016/j.peva.2005.06.001openalex-snapshot
Logic and stochastic modeling with S m A r T
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80535-8openalex-snapshot
Monotonic Extensions of Petri Nets
inferred← citeshttps://doi.org/10.1023/a:1015669415634openalex-snapshot
Efficient Computation and Representation of Large Reachability Sets for Composed Automata
inferred← citeshttps://doi.org/10.1023/a:1020321222420openalex-snapshot
Hierarchical Reachability Graph Generation for Petri Nets
inferred← citeshttps://doi.org/10.1109/32.761444openalex-snapshot
Transient analysis of superposed GSPNs
inferred← citeshttps://doi.org/10.1109/acsd.2012.26openalex-snapshot
An Algorithmic Framework for Coverability in Well-Structured Systems
inferred← citeshttps://doi.org/10.1109/cec.2018.8477717openalex-snapshot
The Simulated Tree-Growth Algorithm Based on T-Invariants for State Reduction of Petri Nets
inferred← citeshttps://doi.org/10.1109/dsn.2002.1029009openalex-snapshot
Efficient state space generation of GSPNs using decision diagrams
inferred← citeshttps://doi.org/10.1109/pnpm.1997.595541openalex-snapshot
Transient analysis of superposed GSPNs
inferred← citeshttps://doi.org/10.1109/pnpm.1999.796528openalex-snapshot
On the efficient sequential and distributed generation of very large Markov chains from stochastic Petri nets
inferred← citeshttps://doi.org/10.1109/pnpm.1999.796529openalex-snapshot
A data structure for the efficient Kronecker solution of GSPNs
inferred← citeshttps://doi.org/10.1109/pnpm.2001.953351openalex-snapshot
What a structural world [structural decomposition]
inferred← citeshttps://doi.org/10.1109/pnpm.2001.953358openalex-snapshot
Compact representations of probability distributions in the analysis of Superposed GSPNs
inferred← citeshttps://doi.org/10.1109/pnpm.2001.953360openalex-snapshot
Efficient solution of GSPNs using canonical matrix diagrams
inferred← citeshttps://doi.org/10.1109/pnpm.2001.953361openalex-snapshot
A reachability graph construction algorithm based on canonical transition firing count vectors
inferred← citeshttps://doi.org/10.1109/pnpm.2003.1231538openalex-snapshot
Computing response time distributions using stochastic Petri nets and matrix diagrams
inferred← citeshttps://doi.org/10.1109/qest.2009.29openalex-snapshot
Reachable State Space Generation for Structured Models which Use Functional Transitions
inferred← citeshttps://doi.org/10.1109/qest.2011.36openalex-snapshot
Composition and Equivalence of Markovian and Non-Markovian Models
inferred← citeshttps://doi.org/10.1109/tac.2010.2046106openalex-snapshot
The Diagnosability of Petri Net Models Using Minimal Explanations
inferred← citeshttps://doi.org/10.1109/tr.2007.909761openalex-snapshot
Detecting and Exploiting Symmetry in Discrete-State Markov Models
inferred← citeshttps://doi.org/10.1145/1190366.1190367openalex-snapshot
Structured analysis techniques for large Markov chains
inferred← citeshttps://doi.org/10.1145/339331.339417openalex-snapshot
Using the exact state space of a Markov model to compute approximate stationary measures
inferred← citeshttps://doi.org/10.1145/345063.339417openalex-snapshot
Using the exact state space of a Markov model to compute approximate stationary measures
inferred← citeshttps://doi.org/10.1287/ijoc.12.3.203.12634openalex-snapshot
Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models
inferred← citeshttps://doi.org/10.21220/s2-sjja-aj08openalex-snapshot
Data Structures For The Analysis Of Large Structured Markov Models
inferred← citeshttps://doi.org/10.2139/ssrn.7590177openalex-snapshot
Saturation Meets SMT: Locality-Aware Reachability over Logical Predicates
inferred← citeshttps://doi.org/10.3176/proc.2013.1.07openalex-snapshot
Bounded saturation-based CTL model checking; pp. 59–70
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.