Accueil › Annuaire des chercheurs › Djamel Eddine Saïdouni
Djamel Eddine Saïdouni
Affiliation : Université Constantine 2
- 96Publications (affiliation algérienne)
- 142Publications au total
- 845Citations
- 13Indice h
C’est vous ? Faites connaître vos travaux
Créez gratuitement votre profil DzCademia et ajoutez vos articles : ils apparaîtront plus facilement sur Google et dans les assistants d’IA comme ChatGPT. Plus de personnes pourront vous lire et vous citer.
Créer mon profil gratuit Ajouter mes publicationsDomaines de recherche
- Formal Methods in Verification
- Petri Nets in System Modeling
- Logic, programming, and type systems
- Multi-Agent Systems and Negotiation
- Business Process Modeling and Analysis
Publications (96)
- Shielded Reinforcement Learning for Safe Agent Transition System: An Autonomous Electric Vehicle Case Study
- A Multimodal Approach for Real-Time Violence Detection Based on Physical Actions and Facial Expressions
- Explainable Machine Learning for Context Safety Decisions in Intelligent Transportation Systems
- DynIoT-DDoS: a mobility-aware, multi-attack DDoS detection dataset for Smart City IoT
- Formal Modelling and Verification of Multi-Parameter Context and Agent Transition Systems: Application to Urban Delivery Zone and Autonomous Electric Vehicle
- Context modelling for Intelligent Transportation Systems: Concepts, Approaches, and Applications
- A Finite Representation of Durational Action Timed Automata Semantics
- Failure recovery mechanism for BDI agents based on abilities and discovery protocols
- Parallel MLTS Construction Preserving the Alpha Equivalence Reduction
- Modelling and Implementation of Complex Systems
- Platforms Cooperation Based on CIoTAS Protocol
- CIoTAS-TA Protocol: CloudIoT Available Services-based Time Aware Protocol
- Internet of Things Meet Internet of Threats: New Concern Cyber Security Issues of Critical Cyber Infrastructure
- CIoTAS protocol: CloudIoT available services protocol through autonomic computing against distributed denial of services attacks
- A Pragmatic Cybersecurity Strategies for Combating IoT-Cyberattacks
- Formal Verification of UML MARTE Specifications Based on a True Concurrency Real Time Model
- A state space distribution approach based on system behaviour
- Cyber Attacks Classification in IoT-Based-Healthcare Infrastructure
- A Context-Aware Distributed Protocol for Updating BDI Agents Abilities
- Hierarchical System Design Using Refinable Recursive Petri Net
- Towards A Generic Predictive-Based Plan Selection Approach for BDI Agents
- Fuzzy Labeled Transition Refinement Tree
- Time and Space Reasoning for Ambient Systems
- A timed semantics for web services composition
- Modelling and Implementation of Complex Systems
- Learning from situated experiences for a contextual planning guidance
- Open Fuzzy Synchronized Petri Net
- Newton’s Law of Universal Gravitation Based Genetic Algorithm for Graph Distribution
- Solving preemptive job-shop scheduling problems using a true concurrency model
- Contextual time reasoning for mobile ambient agents
- Towards a Comprehensive Formal Model for Business Processes
- Relative time rates in dynamic timed automata
- A New and Fast Variant of the Strict Strong Coloring Based Graph Distribution Algorithm
- Towards an Optimal Generation of Zones Graph Relating Timed Bisimulation Relation and Distribution
- A Guidance of Ambient Agents Adapted to Opportunistic Situations
- Relative time rates in dynamic timed automata
- A discrete flower pollination algorithm for graph coloring problem
- Dealing with temporal failure in ambient systems: a dynamic revision of plans
- Improving the Contextual Selection of BDI Plans by Incorporating Situated Experiments
- Application of Fuzzy Labeled Transition System to Contract Net Protocol
- A Hybrid Discrete Flower Pollination Algorithm for Graph Coloring Problem
- A New and Fast Evolutionary Algorithm for Strict Strong Graph Coloring Problem
- A reduced maximality labeled transition system generation for recursive Petri nets
- Towards Agent Oriented Methodology
- Spatio-Temporal Planning for Mobile Ambient Agents
- Interpretation of DD-LOTOS Specification by C-DATA*
- An Integrated Approach for Specification and Analysis of Functional and Performance Properties of Concurrent Systems
- Formal Modeling and Analysis of Business Process Timed Constraints
- Enhancing the parallel state space generation for real-time systems
- Formal testing theory of stochastic systems under maximality semantics
- Hierarchical Design Method for Multi-Agent Systems
- Strict Strong Graph Coloring
- Binary decision diagram based generation algorithm for large scale graph distribution
- An Efficient Evolutionary Algorithm for Strict Strong Graph Coloring Problem
- A new and fast variant of the strict strong coloring based graph distribution algorithm
- Relative Timed Model for Coordinated Multi Agent Systems
- A Higher-Order Agent Model with Contextual Planning Management for Ambient Systems
- Fuzzy Labeled Transition Refinement Tree
- Timed Automata with Action Durations – From Theory to Implementation
- A Formal Approach for Contextual Planning Management: Application to Smart Campus Environment
- From Intentions to Plans: A Contextual Planning Guidance
- Contextual-Timed Planning Management for Ambient Systems
- Formalization and analysis of timed BPEL
- FMEBP: A Formal Modeling Environment of Business Process
- An Efficient Evolutionary Algorithm for Strict Strong Graph Coloring Problem
- Formalizing Timed BPEL by D-LOTOS
- True Concurrency Semantics
- A Generalized Graph Strict Strong Coloring Algorithm
- Forward Analysis of Timed Automata with Action Durations: Theory and Implementation
- Time Petri Nets with Action Duration
- The Strict Strong Coloring Based Graph Distribution Algorithm
- Maximality Semantic For Recursive Petri Nets
- Maximality-Based Labeled Transition Systems Normal Form
- Testing Stochastic Systems Using MoVoS Tool: Case Studies
- A Hybrid Quantum Genetic Algorithm and Local Search based DPLL for Max 3-SAT Problems
- Pruning Search Spaces of RATA Model for the Job-Shop Scheduling
- Towards an Integrated Specification and Analysis of Functional and Temporal Properties:
- A Generalized Graph Strict Strong Coloring Algorithm
- Durational Actions Timed Automata: Determinization and Expressiveness
- Verification of Durational Action Timed Automata using UPPAAL
- A simple approach for reducing timed automata
- A Graph Transformation Approach for Testing Timed Systems
- Transforming DATA* with Dotty Format to Aggregate Region Automaton
- Graph grammar approach for transforming DATA
- FROM A MODEL OF CONCURRENCY TO A TEST MODEL: A GRAPH TRANSFORMATION BASED APPROACH
- A model for job-shop problem
- A New Quantum Evolutionary Algorithm with Sifting Strategy for Binary Decision Diagram Ordering Problem
- Maximality semantics based stochastic process algebra for performance evaluation
- A New Quantum Evolutionary Algorithm with Sifting Strategy for Binary Decision Diagram Ordering Problem
- Parallel State Space Construction for a Model Checking Based on Maximality Semantics
- Maximality-Based Structural Operational Semantics for Petri Nets
- A New Quantum Evolutionary Local Search Algorithm for MAX 3-SAT Problem
- Aggregation of Transitions in Marking Graph Generation Based on Maximality Semantics for Petri Nets
- FOCOVE: Formal Concurrency Verification Environment for Complex Systems
- Quantum Differential Evolution Algorithm for Variable Ordering Problem of Binary Decision Diagram
- Maximality-based symbolic model checking
Co-auteurs
- Ilham Kitouni
- Nabil Belala
- Meriem Bensouyad
- Nousseiba Guidoum
- Ahmed‐Chawki Chaouche
- Radja Boukharrou
- Messaouda Bouneb
- Mourad Bouzenada
- Hiba Hachichi
- Imed Eddine Chama
- Ahmed Bouzenada
- Abdesslem Layeb
Données bibliographiques issues d’OpenAlex (base ouverte).
Pourquoi choisir Dzcademia ?
Pour donner à vos travaux plus de chances d’être découverts et recommandés par les IA. Profils, articles et communications : donnez à votre recherche une présence publique structurée. Les métadonnées intégrées aident les moteurs de recherche et les assistants IA à identifier vos travaux et à comprendre leurs références.
Commenter avec Google
Connecte-toi avec Google pour commenter directement sur cette page.