The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Adapting an AI Planning Heuristic for Directed Model Checking
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Traditional AI Agents feature limited learning mechanisms, such as heuristic parameter adjustment [161], [162] or history-informed context retention.”
From AI Agents vs. Agentic AI: A Conceptual Taxonomy, Applications and Challenges (2025) · cites this paper as [162]
Citations
Cites
Journal of Universal Computer Science
Salomaa, A. K., Calude, C. S., & Maurer, H. A. (2020) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.3217/jucs-000-00-0109 · Cited by 3,393
A Temporal Logic of Nested Calls and Returns
Alur, R., Etessami, K., & Madhusudan, P. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24730-2_35 · Cited by 3,339
Spin model checker, the: primer and reference manual
Holzmann, G. J. (2003) · Cited by 2,009
The FF Planning System: Fast Plan Generation Through Heuristic Search
Hoffmann, J., & Nebel, B. (2001) · Journal of Artificial Intelligence Research · doi:10.1613/jair.855 · Cited by 1,840
Self-citationBehrmann, G., David, A., & Larsen, K. G. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30080-9_7 · Cited by 1,595
Self-citationBonet, B., & Geffner, H. (2001) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00108-4 · Cited by 959
ACSAR: Software Model Checking with Transfinite Refinement
Seghir, M. N., & Podelski, A. (2007) · Springer eBooks · doi:10.1007/978-3-540-73370-6_19 · Cited by 618
The Metric-{FF} Planning System: Translating {"Ignoring Delete Lists"} To Numeric State Variables
Hoffmann, J. (2003) · Max Planck Digital Library · Cited by 410
Self-citationPlanning Through Stochastic Local Search and Temporal Action Graphs in LPG
Gerevini, A., Saetti, A., & Serina, I. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1183 · Cited by 318
Secure synthesis of code: a process improvement experiment
Garbett, P., Parkes, J. P., Shackleton, M., & Anderson, S. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48118-4_46 · Cited by 224
The Metric-FF Planning System: Translating ``Ignoring Delete Lists'' to Numeric State Variables
Hoffmann, J. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1144 · Cited by 197
Self-citationValidation with guided search of the state space
Yang, C. H., & Dill, D. L. (1998) · Proceedings - ACM IEEE Design Automation Conference · doi:10.1145/277044.277201 · Cited by 176
Directed explicit model checking with HSF-SPIN
Edelkamp, S., Lafuente, A. L., & Leue, S. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45139-0_5 · Cited by 169
Directed explicit-state model checking in the validation of communication protocols
Edelkamp, S., Leue, S., & Lafuente, A. L. (2004) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-002-0104-3 · Cited by 165
Efficient Guiding Towards Cost-Optimality in UPPAAL
Behrmann, G., Fehnker, A., Hune, T. S., Larsen, K. G., Pettersson, P., & Romijn, J. M. T. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45319-9_13 · Cited by 141
Self-citationBehrmann, G., Bengtsson, J. E., David, A., Larsen, K. G., Pettersson, P., & Wang, Y. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45739-9_1 · Cited by 127
Self-citationModel checking Java programs using structural heuristics
Groce, A., & Visser, W. (2002) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/566171.566175 · Cited by 81
Directed Model Checking with Distance-Preserving Abstractions
Dräge, K., Finkbeiner, B., Podelski, A., & Valmari, A. (2006) · Max Planck Institute for Plasma Physics · Cited by 57
Symbolic guided search for CTL model checking
Bloem, R., Ravi, K., & Somenzi, F. (2000) · Proceedings - ACM IEEE Design Automation Conference · doi:10.1145/337292.337306 · Cited by 57
KI 2004: Advances in Artificial Intelligence
Biundo, S., Palm, G., & Frühwirth, T. (2004) · Lecture notes in computer science · doi:10.1007/b100351 · Cited by 45
Model checking Java programs using structural heuristics
Groce, A., & Visser, W. (2002) · ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA) · doi:10.1145/566172.566175 · Cited by 43
Guided Invariant Model Checking Based on Abstraction and Symbolic Pattern Databases
Qian, K., & Nymeyer, A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24730-2_37 · Cited by 42
The UniForM workbench a universal development environment for formal methods
Krieg-Brückner, B., Peleška, J., Olderog, E.-R., & Baer, A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48118-4_13 · Cited by 39
Directed Model Checking with Distance-Preserving Abstractions
Dräger, K., Finkbeiner, B., & Podelski, A. (2006) · Lecture notes in computer science · doi:10.1007/11691617_2 · Cited by 31
Comparing model checking and logical reasoning for real-time systems
Dierks, H. (2004) · Formal Aspects of Computing · doi:10.1007/s00165-004-0034-9 · Cited by 28
Self-citationSUBGOAL PARTITIONING AND GLOBAL SEARCH FOR SOLVING TEMPORAL PLANNING PROBLEMS IN MIXED SPACE
Wah, B. W.-S., & Chen, Y. (2004) · International Journal of Artificial Intelligence Tools · doi:10.1142/s0218213004001806 · Cited by 18
Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Frankl, P. G. (2002) · Cited by 15
Moby/RT: A Tool for Specification and Verification of Real-Time Systems
Olderog, E.-R., & Dierks, H. (2020) · doi:10.3217/jucs-009-02-0088 · Cited by 12
Self-citationGeneralizing the Relaxed Planning Heuristic to Non-linear Tasks
Edelkamp, S. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30221-6_16 · Cited by 9
Cited by
AI Agents vs. Agentic AI: A Conceptual taxonomy, applications and challenges
Sapkota, R., Roumeliotis, K. I., & Karkee, M. (2026) · Information Fusion · doi:10.1016/j.inffus.2025.103599 · Cited by 671
AI Agents vs. Agentic AI: A Conceptual Taxonomy, Applications and Challenges
Sapkota, R., Roumeliotis, K. I., & Karkee, M. (2025) · SuperIntelligence - Robotics - Safety & Alignment · doi:10.70777/si.v2i3.15161 · Cited by 186
Metadata
- Authors
- Kupferschmid, S., Hoffmann, J., Dierks, H., & Behrmann, G.
- Affiliations
- University of Freiburg (DE)
- Oldenburger Institut für Informatik (DE)
- Aalborg University (DK)
- ORCID
- Hoffmann, Jörg
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 35-52
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1528447803
- Cited by
- 50
- References
- 29
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 1 · 2021: 1 · 2020: 1 · 2019: 2 · 2018: 2 · 2017: 4 · 2016: 5 · 2015: 2 · 2014: 3 · 2012: 2
- FWCI
- 5.09
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Max Planck Institute for Plasma Physics (submittedVersion)
- VBN Forskningsportal (Aalborg Universitet) (submittedVersion)
- MPG.PuRe (Max Planck Society) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Formal Methods in Verification
- Physical Sciences › Computer Science › Software › Software Testing and Debugging Techniques
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Petri Nets in System Modeling
- Keywords
- heuristic function, abstraction, communicating automata, timed automata, clock variables, UPPAAL, search space reduction, integer variables
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
