On the public citation graph

Heuristic Search for the Analysis of Graph Transition Systems

0 signed · 47 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/11691617_19openalex-snapshot
Model Checking Dynamic States in GROOVE
inferredcites →https://doi.org/10.1007/3-540-44829-2_13openalex-snapshot
Promela Planning
inferredcites →https://doi.org/10.1007/3-540-44829-2_17openalex-snapshot
Software Verification with BLAST
inferredcites →https://doi.org/10.1007/3-540-45465-9_51openalex-snapshot
A Spatial Logic for Querying Graphs
inferredcites →https://doi.org/10.1007/978-3-642-55548-0openalex-snapshot
Komplexitätstheorie
inferredcites →https://doi.org/10.1007/bf01384313openalex-snapshot
Property preserving abstractions for the verification of concurrent systems
inferredcites →https://doi.org/10.1007/bfb0056478openalex-snapshot
The arrow distributed directory protocol
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/s10270-003-0050-xopenalex-snapshot
Automated formal verification of visual modeling languages by model checking
inferredcites →https://doi.org/10.1016/0004-3702(85)90084-0openalex-snapshot
Depth-first iterative-deepening
inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/j.entcs.2004.02.062openalex-snapshot
Joint Optimization and Reachability Analysis in Graph Transformation Systems with Time
inferredcites →https://doi.org/10.1016/j.entcs.2004.08.018openalex-snapshot
Verifying a Behavioural Logic for Graph Transformation Systems
inferredcites →https://doi.org/10.1016/j.entcs.2004.12.036openalex-snapshot
Time and Space Issues in the Generation of Graph Transition Systems
inferredcites →https://doi.org/10.1016/j.entcs.2005.03.031openalex-snapshot
Graphical Verification of a Spatial Logic for the π-calculus
inferredcites →https://doi.org/10.1016/j.entcs.2005.10.036openalex-snapshot
A Logic for Application Level QoS
inferredcites →https://doi.org/10.1016/j.entcs.2006.01.022openalex-snapshot
Abstract Graph Transformation
inferredcites →https://doi.org/10.1016/s0004-3702(01)00108-4openalex-snapshot
Planning as heuristic search
inferredcites →https://doi.org/10.1016/s0890-5401(03)00137-8openalex-snapshot
A spatial logic for concurrency (part I)
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1109/tnet.2002.801397openalex-snapshot
Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet
inferredcites →https://doi.org/10.1109/tssc.1968.300136openalex-snapshot
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
inferredcites →https://doi.org/10.1142/9789812384720openalex-snapshot
Handbook of Graph Grammars and Computing by Graph Transformation
inferredcites →https://doi.org/10.1142/9789812384720_0003openalex-snapshot
ALGEBRAIC APPROACHES TO GRAPH TRANSFORMATION – PART I: BASIC CONCEPTS AND DOUBLE PUSHOUT APPROACH
inferredcites →https://doi.org/10.1142/9789812384720_0005openalex-snapshot
THE EXPRESSION OF GRAPH PROPERTIES AND GRAPH TRANSFORMATIONS IN MONADIC SECOND-ORDER LOGIC
inferredcites →https://doi.org/10.1145/566171.566175openalex-snapshot
Model checking Java programs using structural heuristics
inferredcites →https://doi.org/10.1613/jair.1302openalex-snapshot
Taming Numbers and Durations in the Model Checking Integrated Planning System
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search

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-49487-6_6openalex-snapshot
External-Memory State Space Search
inferred← citeshttps://doi.org/10.1007/978-3-319-59147-6_37openalex-snapshot
Heuristics for ROSA’s LTS Searching
inferred← citeshttps://doi.org/10.1007/s00500-018-3444-yopenalex-snapshot
MS-ACO: a multi-stage ant colony optimization to refute complex software systems specified through graph transformation
inferred← citeshttps://doi.org/10.1007/s00500-022-07044-5openalex-snapshot
Using deep learning techniques for solving AI planning problems specified through graph transformations
inferred← citeshttps://doi.org/10.1007/s10515-014-0163-1openalex-snapshot
A model-driven framework for guided design space exploration
inferred← citeshttps://doi.org/10.1016/j.asoc.2014.06.055openalex-snapshot
A heuristic solution for model checking graph transformation systems
inferred← citeshttps://doi.org/10.1016/j.asoc.2015.04.032openalex-snapshot
A meta-heuristic solution for automated refutation of complex software systems specified through graph transformations
inferred← citeshttps://doi.org/10.1016/j.engappai.2020.103684openalex-snapshot
A novel approach to solve AI planning problems in graph transformations
inferred← citeshttps://doi.org/10.1016/j.jvlc.2012.12.002openalex-snapshot
Scenario-driven analysis of systems specified through graph transformations
inferred← citeshttps://doi.org/10.1109/ase.2011.6100051openalex-snapshot
A model-driven framework for guided design space exploration
inferred← citeshttps://doi.org/10.1145/2642937.2643005openalex-snapshot
Multi-objective optimization in rule-based design space exploration
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.2.61openalex-snapshot
Optimization in Graph Transformation Systems Using Petri Net Based Techniques
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.40.583.614openalex-snapshot
Towards Guided Trajectory Exploration of Graph Transformation Systems
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.58.843.838openalex-snapshot
Interactive Strategy-Based Validation of Behavioral Models
inferred← citeshttps://doi.org/10.3233/ifs-162127openalex-snapshot
A greedy algorithm versus metaheuristic solutions to deadlock detection in Graph Transformation Systems
inferred← citeshttps://doi.org/10.3990/1.9789036534772openalex-snapshot
Abstract graph transformation
inferred← citeshttps://doi.org/10.4204/eptcs.159.7openalex-snapshot
Graph Transformation Planning via Abstraction
inferred← citeshttps://doi.org/10.4204/eptcs.99.6openalex-snapshot
Graph Subsumption in Abstract State Space Exploration
inferred← citeshttps://doi.org/10.61186/jsdp.20.2.175openalex-snapshot
Checking reachability property of systems specified through graph transformation with the approach of discovery conditional dependency between the rules
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.