On the public citation graph
Saturation-Based Symbolic Reachability Analysis Using Conjunctive and Disjunctive Partitioning
0 signed · 71 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.1007/3-540-36126-x_14openalex-snapshot
Traversal Techniques for Concurrent Systems
inferredcites →https://doi.org/10.1007/3-540-40922-x_6openalex-snapshot
Border-Block Triangular Form and Conjunction Schedule in Image Computation
inferredcites →https://doi.org/10.1007/3-540-45319-9_23openalex-snapshot
Saturation: An Efficient Iteration Strategy for Symbolic State—Space Generation
inferredcites →https://doi.org/10.1007/3-540-46002-0_22openalex-snapshot
Fine-Grain Conjunction Scheduling for Symbolic Reachability Analysis
inferredcites →https://doi.org/10.1007/3-540-46419-0_28openalex-snapshot
Symbolic Reachability Analysis Based on SAT-Solvers
inferredcites →https://doi.org/10.1007/3-540-48153-2openalex-snapshot
Correct Hardware Design and Verification Methods
inferredcites →https://doi.org/10.1007/3-540-48683-6_44openalex-snapshot
NuSMV: A New Symbolic Model Verifier
inferredcites →https://doi.org/10.1007/3-540-58152-9_23openalex-snapshot
Petri net analysis using boolean manipulation
inferredcites →https://doi.org/10.1007/3-540-69108-1openalex-snapshot
Application and Theory of Petri Nets 1998
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_35openalex-snapshot
A Temporal Logic of Nested Calls and Returns
inferredcites →https://doi.org/10.1007/978-3-540-39724-3_6openalex-snapshot
Efficient Symbolic Model Checking of Software Using Partial Disjunctive Partitioning
inferredcites →https://doi.org/10.1007/978-3-540-45232-4_6openalex-snapshot
Logical and Stochastic Modeling with Smart
inferredcites →https://doi.org/10.1007/bf01211911openalex-snapshot
Compositional minimisation of finite state systems using interface specifications
inferredcites →https://doi.org/10.1016/0196-6774(82)90023-2openalex-snapshot
An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
inferredcites →https://doi.org/10.1016/j.laa.2004.01.006openalex-snapshot
Symbolic state-space exploration and numerical analysis of state-sharing composed models
inferredcites →https://doi.org/10.1109/iccad.1997.643565openalex-snapshot
Reachability analysis using partitioned-ROBDDs
inferredcites →https://doi.org/10.1109/iccd.1990.130209openalex-snapshot
A parallel algorithm for constructing binary decision diagrams
inferredcites →https://doi.org/10.1109/pnpm.1999.796529openalex-snapshot
A data structure for the efficient Kronecker solution of GSPNs
inferredcites →https://doi.org/10.1109/qest.2004.1348042openalex-snapshot
Saturation for a general class of models
inferredcites →https://doi.org/10.1109/qest.2004.38openalex-snapshot
Saturation for a general class of models
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/317786.317819openalex-snapshot
On the stochastic structure of parallelism and synchronization models for distributed algorithms
inferredcites →https://doi.org/10.1145/337292.337306openalex-snapshot
Symbolic guided search for CTL model checking
inferredcites →https://doi.org/10.5555/266388.266513openalex-snapshot
Reachability analysis using partitioned-ROBDDs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/pamm.200700833openalex-snapshot
Decision diagrams for the approximate analysis of Markov models
inferred← citeshttps://doi.org/10.1007/11549970_2openalex-snapshot
Implicit Representations and Algorithms for the Logic and Stochastic Analysis of Discrete–State Systems
inferred← citeshttps://doi.org/10.1007/11691372_6openalex-snapshot
New Metrics for Static Variable Ordering in Decision Diagrams
inferred← citeshttps://doi.org/10.1007/11691372_8openalex-snapshot
Efficient Guided Symbolic Reachability Using Reachability Expressions
inferred← citeshttps://doi.org/10.1007/11901914_7openalex-snapshot
A Fine-Grained Fullness-Guided Chaining Heuristic for Symbolic Reachability Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-21571-2_17openalex-snapshot
Improving Saturation Efficiency with Implicit Relations
inferred← citeshttps://doi.org/10.1007/978-3-030-21571-2_19openalex-snapshot
Saturation Enhanced with Conditional Locality: Application to Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-61739-4_3openalex-snapshot
Reachability Set Generation Using Hybrid Relation Compatible Saturation
inferred← citeshttps://doi.org/10.1007/978-3-319-13338-6_16openalex-snapshot
Read, Write and Copy Dependencies for Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-39086-4_9openalex-snapshot
PetriDotNet 1.5: Extensible Petri Net Editor and Analyser for Education and Research
inferred← citeshttps://doi.org/10.1007/978-3-319-57861-3_14openalex-snapshot
Getting the Priorities Right: Saturation for Prioritised Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-89960-2_18openalex-snapshot
Generation of Minimum Tree-Like Witnesses for Existential CTL
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_50openalex-snapshot
Bounded Reachability Checking of Asynchronous Systems Using Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-540-72522-0_9openalex-snapshot
Data Representation and Efficient Solution: A Decision Diagram Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-73094-1_8openalex-snapshot
Improving Static Variable Orders Via Invariants
inferred← citeshttps://doi.org/10.1007/978-3-540-85762-4_6openalex-snapshot
Symbolic Reachability for Process Algebras with Recursive Data Types
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_52openalex-snapshot
Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_53openalex-snapshot
Symbolic Reachability Analysis of Integer Timed Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-04761-9_27openalex-snapshot
Symbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation
inferred← citeshttps://doi.org/10.1007/978-3-642-54862-8_38openalex-snapshot
Symbolic Model Checking of Stutter-Invariant Properties Using Generalized Testing Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-58381-4_4openalex-snapshot
Decision Diagrams for Petri Nets: A Comparison of Variable Ordering Algorithms
inferred← citeshttps://doi.org/10.1007/s00446-011-0139-3openalex-snapshot
Symbolic synthesis of masking fault-tolerant distributed programs
inferred← citeshttps://doi.org/10.1007/s10009-007-0057-7openalex-snapshot
Efficient guided symbolic reachability using reachability expressions
inferred← citeshttps://doi.org/10.1007/s10009-009-0099-0openalex-snapshot
Decision-diagram-based techniques for bounded reachability checking of asynchronous systems
inferred← citeshttps://doi.org/10.1016/j.peva.2011.02.005openalex-snapshot
Approximate steady-state analysis of large Markov models based on the structure of their decision diagram encoding
inferred← citeshttps://doi.org/10.1016/j.scico.2017.09.003openalex-snapshot
Industrial applications of the PetriDotNet modelling and analysis tool
inferred← citeshttps://doi.org/10.1109/acsd.2018.000-4openalex-snapshot
SOUPS: A Variable Ordering Metric for the Saturation Algorithm
inferred← citeshttps://doi.org/10.1109/jva60410.2023.00018openalex-snapshot
Research Directions in Decision Diagram Technology
inferred← citeshttps://doi.org/10.1109/qest.2009.14openalex-snapshot
Petri Net Analysis Using Decision 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.13140/2.1.4071.1040openalex-snapshot
Deterministic Anytime Inference for Stochastic Continuous-Time Markov Processes
inferred← citeshttps://doi.org/10.1613/jair.4415openalex-snapshot
Tutorial on Structured Continuous-Time Markov Processes
inferred← citeshttps://doi.org/10.21236/ada460390openalex-snapshot
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs
inferred← citeshttps://doi.org/10.2139/ssrn.7590177openalex-snapshot
Saturation Meets SMT: Locality-Aware Reachability over Logical Predicates
inferred← citeshttps://doi.org/10.25335/m5jh3d441openalex-snapshot
Towards automated model revision for fault-tolerant systems
inferred← citeshttps://doi.org/10.31274/td-20240329-411openalex-snapshot
Implicit relations and their derivatives for symbolic state space generation
inferred← citeshttps://doi.org/10.3311/ppee.2080openalex-snapshot
Advanced Saturation-based Model Checking of Well-formed Coloured Petri Nets
inferred← citeshttps://doi.org/10.3990/1.9789036548441openalex-snapshot
Efficient learning and analysis of system behavior
inferred← citeshttps://doi.org/10.4204/eptcs.14.1openalex-snapshot
Parallel symbolic state-space exploration is difficult, but what is the alternative?
inferred← citeshttps://doi.org/10.4204/eptcs.54.2openalex-snapshot
Improving BDD Based Symbolic Model Checking with Isomorphism Exploiting Transition Relations
inferred← citeshttps://doi.org/10.70675/63a98cc3z9ff1z42cdz8719zda16ae0380c0openalex-snapshot
Vérification symbolique de modèles à l'aide de systèmes de ré-écriture dédiés
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.