Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.
EDBT 2026 Demo / reviewers in the wild / expert

Imed Ben Abdallah

dblp:77/3207 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%
Theoretical computer science
1 paper
Automata and formal languages · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › real-time scheduling › resource sharing protocols
deadlock-free scheduling		 0.011998
An Efficient Search Algorithm for Deadlock-Free Scheduling in FMS Using Petri Nets · ICRA 1998
Embedded and real-time systems
real-time scheduling		 0.011998
An Efficient Search Algorithm for Deadlock-Free Scheduling in FMS Using Petri Nets · ICRA 1998
Automata and formal languages
petri nets		 0.011998
An Efficient Search Algorithm for Deadlock-Free Scheduling in FMS Using Petri Nets · ICRA 1998

Methods — techniques the papers use, named apart from their topics

depth-first search · 0.0branch-and-bound · 0.0
YearPublicationVenuePosition
1998 An Efficient Search Algorithm for Deadlock-Free Scheduling in FMS Using Petri Nets
abstract
An efficient search algorithm for finding optimal deadlock-free schedules in FMS modeled by S/sup 4/R nets is presented. The algorithm is based on the branch and bound principle, the depth first search and truncation techniques based on the structure theory of Petri nets. It is applied to the timed S/sup 4/R net extended with priority rules. The efficiency of the proposed approach is illustrated using an example from the literature.
Imed Ben Abdallah, Hoda A. ElMaraghy, Tarek Y. ElMekkawy
 ICRA1
1998 On deadlock-free scheduling in FMS
abstract
The effect of routing flexibility on the performance of the manufacturing system is studied. A deadlock-free scheduling algorithm, developed for S/sup 4/R nets is used for experimentation. The issues addressed in the paper include extending the S/sup 4/R nets with additional places to take into account machine breakdowns, and the derivation of the set of uncontrolled minimal siphons of the extended net from the set of the original net. Finally, an experimental study is conducted for performance evaluation.
Imed Ben Abdallah, Tarek Y. ElMekkawy, Hoda A. ElMaraghy
 SMC1