Demo Data from EDBT 2026 / reviewers in the wild / expert
Hassan Ibrahim
dblp:173/2552
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2017
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Automated reasoning and model checking · 100% | |
| Artificial intelligence
1 paper |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automated reasoning and model checking › diagnosis
diagnosability |
0.3 | 1 | 2017 | Diagnosability Planning for Controllable Discrete Event Systems · AAAI 2017 |
Automated reasoning and model checking
discrete event systems |
0.3 | 1 | 2017 | Diagnosability Planning for Controllable Discrete Event Systems · AAAI 2017 |
Methods — techniques the papers use, named apart from their topics
twin plant construction · 0.6heuristic search · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Diagnosability Planning for Controllable Discrete Event SystemsabstractIn this paper, we propose an approach to ensure the diagnosability of a partially controllable system. Given a model of correct and faulty behaviors of a partially observable discrete event system, equipped with a set of elementary actions that do not intertwine with autonomous events, we search a diagnosability plan, i.e., a sequence of applicable actions that leads the system from an initial belief state (a set of potentially current states) to a diagnosable belief state, in which the system is then left to run freely. This helps in reducing the diagnosis interaction with running systems and can be applied, e.g., on the output of a repair plan, like in power networks. The two successive stages of this approach keep diagnosability planning, including diagnosability tests, in PSpace in comparison to the Exptime test for the more complex active diagnosability used usually in such cases. For this, we propose to construct incrementally the twin plant structure of the given system and to exploit its parts already constructed while testing the candidate plans and constructing its next parts. This helps in pruning the twin plant constructions and many non-diagnosability plan tests. We have created a special benchmark and tested three proposed methods, according to the recycling level of twin plants construction, with one cost function used for plan optimality and an optional heuristics. Hassan Ibrahim, Philippe Dague, Alban Grastien, Lina Ye |
AAAI | 1 |
| 2015 | Using Incremental SAT for Testing Diagnosability of Distributed DES
Hassan Ibrahim, Philippe Dague |
DX | 1 |