Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL
From MaRDI portal
Publication:5423882
DOI10.1007/978-3-540-74128-2_4zbMath1196.68139OpenAlexW1545265909MaRDI QIDQ5423882
Andreas Podelski, Sebastian Kupferschmid, Jörg Hoffmann, Andrey Rybalchenko, Jan-Georg Smaus
Publication date: 1 November 2007
Published in: Model Checking and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74128-2_4
Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (4)
Abstractions and Pattern Databases: The Quest for Succinctness and Accuracy ⋮ Transition-Based Directed Model Checking ⋮ Fast Directed Model Checking Via Russian Doll Abstraction ⋮ The Causal Graph Revisited for Directed Model Checking
Uses Software
This page was built for publication: Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL
