On the public citation graph
Directed Model Checking with Distance-Preserving Abstractions
0 signed · 46 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/11691617_3openalex-snapshot
Adapting an AI Planning Heuristic for Directed Model Checking
inferredcites →https://doi.org/10.1007/3-540-45139-0_5openalex-snapshot
Directed explicit model checking with HSF-SPIN
inferredcites →https://doi.org/10.1007/3-540-45319-9_13openalex-snapshot
Efficient Guiding Towards Cost-Optimality in UPPAAL
inferredcites →https://doi.org/10.1007/3-540-46017-9_21openalex-snapshot
Heuristic Model Checking for Java Programs
inferredcites →https://doi.org/10.1007/3-540-48118-4_13openalex-snapshot
The UniForM workbench a universal development environment for formal methods
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_37openalex-snapshot
Guided Invariant Model Checking Based on Abstraction and Symbolic Pattern Databases
inferredcites →https://doi.org/10.1007/978-3-540-40007-3_25openalex-snapshot
A Theory of Hints in Model Checking
inferredcites →https://doi.org/10.1007/bf01211911openalex-snapshot
Compositional minimisation of finite state systems using interface specifications
inferredcites →https://doi.org/10.1007/s00165-004-0034-9openalex-snapshot
Comparing model checking and logical reasoning for real-time systems
inferredcites →https://doi.org/10.1007/s10009-002-0104-3openalex-snapshot
Directed explicit-state model checking in the validation of communication protocols
inferredcites →https://doi.org/10.1007/s10009-003-0130-9openalex-snapshot
Heuristics for model checking Java programs
inferredcites →https://doi.org/10.1016/s1571-0661(04)00261-0openalex-snapshot
Trail-Directed Model Checking
inferredcites →https://doi.org/10.1109/26.35374openalex-snapshot
An algorithmic procedure for checking safety properties of protocols
inferredcites →https://doi.org/10.1145/277044.277201openalex-snapshot
Validation with guided search of the state space
inferredcites →https://doi.org/10.1145/337292.337306openalex-snapshot
Symbolic guided search for CTL 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/11691617_3openalex-snapshot
Adapting an AI Planning Heuristic for Directed Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-94111-0_6openalex-snapshot
Star-Topology Decoupling in SPIN
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_52openalex-snapshot
Uppaal/DMC – Abstraction-Based Heuristics for Directed Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-74128-2_4openalex-snapshot
Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL
inferred← citeshttps://doi.org/10.1007/978-3-540-78800-3_15openalex-snapshot
Fast Directed Model Checking Via Russian Doll Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-642-00431-5_10openalex-snapshot
Relaxation Refinement: A New Method to Generate Heuristic Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_19openalex-snapshot
Transition-Based Directed Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-02652-2_17openalex-snapshot
Subsumer-First: Steering Symbolic Reachability Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-03237-0_8openalex-snapshot
The Causal Graph Revisited for Directed Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-19829-8_1openalex-snapshot
Directed Model Checking for B: An Evaluation and New Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-21434-9_11openalex-snapshot
Learning Feature-Based Heuristic Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-40942-4_1openalex-snapshot
Using State-Based Planning Heuristics for Partial-Order Causal-Link Planning
inferred← citeshttps://doi.org/10.1007/s10009-014-0346-xopenalex-snapshot
Downward pattern refinement for timed automata
inferred← citeshttps://doi.org/10.1016/j.artint.2012.05.003openalex-snapshot
Landmark-enhanced abstraction heuristics
inferred← citeshttps://doi.org/10.1609/icaps.v19i1.13351openalex-snapshot
Structural-Pattern Databases
inferred← citeshttps://doi.org/10.1609/icaps.v21i1.13480openalex-snapshot
Abstraction Heuristics Extended with Counting Abstractions
inferred← citeshttps://doi.org/10.1609/icaps.v24i1.13643openalex-snapshot
Flow-Based Heuristics for Optimal Planning: Landmarks and Merges
inferred← citeshttps://doi.org/10.1609/icaps.v25i1.13732openalex-snapshot
On the Expressive Power of Non-Linear Merge-and-Shrink Representations
inferred← citeshttps://doi.org/10.1609/icaps.v26i1.13763openalex-snapshot
An Analysis of Merge Strategies for Merge-and-Shrink Heuristics
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13806openalex-snapshot
Abstraction Heuristics, Cost Partitioning and Network Flows
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13885openalex-snapshot
MS-Lite: A Lightweight, Complementary Merge-and-Shrink Method
inferred← citeshttps://doi.org/10.1609/socs.v2i1.18195openalex-snapshot
Representing Pattern Databases with Succinct Data Structures
inferred← citeshttps://doi.org/10.1609/socs.v6i1.18353openalex-snapshot
Focusing on What Really Matters: Irrelevance Pruning in Merge-and-Shrink
inferred← citeshttps://doi.org/10.24963/ijcai.2017/599openalex-snapshot
Additive Merge-and-Shrink Heuristics for Diverse Action Costs
inferred← citeshttps://doi.org/10.24963/ijcai.2017/618openalex-snapshot
From Qualitative to Quantitative Dominance Pruning for Optimal Planning
inferred← citeshttps://doi.org/10.24963/ijcai.2019/783openalex-snapshot
Merge-and-Shrink Task Reformulation for Classical Planning
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-331openalex-snapshot
Computing perfect heuristics in polynomial time : on bisimulation and merge-and-shrink abstractions in optimal planning
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.