On the public citation graph
Parallel explicit state reachability analysis and state space construction
0 signed · 16 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jpdc.1997.1409openalex-snapshot
Automated Parallelization of Discrete State-Space Generation
inferredcites →https://doi.org/10.1007/3-540-44667-2_10openalex-snapshot
Distributed and Structured Analysis Approaches to Study Large and Complex Systems⋆
inferredcites →https://doi.org/10.1007/3-540-45139-0_14openalex-snapshot
Parallel state space construction for model-checking
inferredcites →https://doi.org/10.1007/bfb0042303openalex-snapshot
Distributed reachability analysis for protocol verification environments
inferredcites →https://doi.org/10.1109/pnpm.1999.796528openalex-snapshot
On the efficient sequential and distributed generation of very large Markov chains from stochastic Petri nets
inferredcites →https://doi.org/10.5555/380921.380941openalex-snapshot
Parallel state space construction for model-checking
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-25017-5_17openalex-snapshot
FSP Modeling of a Generic Distributed Swarm Computing Framework
inferred← citeshttps://doi.org/10.1007/s00500-016-2381-xopenalex-snapshot
Formal framework for distributed swarm computing: abstract model and properties
inferred← citeshttps://doi.org/10.1007/s11227-014-1099-8openalex-snapshot
A BSP algorithm for on-the-fly checking CTL* formulas on security protocols
inferred← citeshttps://doi.org/10.1109/ispdc.2011.12openalex-snapshot
Mixed Shared-Distributed Hash Tables Approaches for Parallel State Space Construction
inferred← citeshttps://doi.org/10.1109/ispdc.2012.10openalex-snapshot
A BSP Algorithm for On-the-fly Checking LTL Formulas on Security Protocols
inferred← citeshttps://doi.org/10.1109/pdmc-hibi.2010.10openalex-snapshot
A General Lock-Free Algorithm for Parallel State Space Construction
inferred← citeshttps://doi.org/10.1109/pdmc-hibi.2010.14openalex-snapshot
A BSP Algorithm for the State Space Construction of Security Protocols
inferred← citeshttps://doi.org/10.1145/2345396.2345433openalex-snapshot
Formal verification methodology considerations for network on chips
inferred← citeshttps://doi.org/10.5281/zenodo.32929openalex-snapshot
Enumerative Parallel And Distributed State Space Construction
inferred← citeshttps://doi.org/10.70675/f3064779zc9e6z4a34zb41czfb795c178132openalex-snapshot
BSP algorithms for LTL & CTL model checking of security protocols
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.