Demo Data from EDBT 2026 / reviewers in the wild / expert
Mengdi Gan
dblp:158/2881
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 1
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
2 papers |
Automata and formal languages · 46% Automated reasoning and model checking · 23% Logic in computer science · 23% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automata and formal languages
petri nets |
0.4 | 2 | 2015 | Macro liveness graph and liveness of ω-independent unbounded nets · Sci. China Inf. Sci. 2015 New reachability trees for unbounded Petri nets · ICRA 2015 |
Logic in computer science › temporal logic
liveness properties |
0.2 | 1 | 2015 | Macro liveness graph and liveness of ω-independent unbounded nets · Sci. China Inf. Sci. 2015 |
Automated reasoning and model checking
reachability |
0.2 | 1 | 2015 | New reachability trees for unbounded Petri nets · ICRA 2015 |
Distributed computing theory › predicate detection › stable property detection
deadlock detection |
0.1 | 1 | 2015 | New reachability trees for unbounded Petri nets · ICRA 2015 |
Methods — techniques the papers use, named apart from their topics
reachability tree · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | New reachability trees for unbounded Petri netsabstractReachability is an important dynamic property of Petri nets. Its determination given an unbounded net and initial marking has remained an open problem since 1960s. Due to its extreme difficulty, a great deal of research has been focused on some subclasses of unbounded nets. For arbitrary ones, this work intends to propose a new reachability tree (NRT), which consists of only but all reachable markings from its initial marking. Furthermore, an NRT-based method to decide deadlocks of unbounded nets is presented. An example is provided to show the new results. ShouGuang Wang, MengChu Zhou, Mengdi Gan, Dan You |
ICRA | 3 |
| 2015 | Macro liveness graph and liveness of ω-independent unbounded nets
ShouGuang Wang, Mengdi Gan, MengChu Zhou |
Sci. China Inf. Sci. | 2 |