Aller au menu Aller au contenu
Our engineering & master degrees
Ecole nationale supérieure de l'Énergie, l'Eau et l'Environnement
Engineering school in energy, water and environment
Our engineering & master degrees
Our engineering & master degrees

> Studies > E3-STU-COURSES

Specification and Design of Discrete Event Systems - 4EUS3SCE

A+Augmenter la taille du texteA-Réduire la taille du texteImprimer le documentEnvoyer cette page par mail cet article Facebook Twitter Linked In
  • Number of hours

    • Lectures : 36.0
    • Tutorials : -
    • Laboratory works : 24.0
    • Projects : -
    • Internship : -
    ECTS : 5.0
  • Officials : Eric ZAMAI


Approach and tools for the specification of a complex industrial automation system and its design: structure and hierarchy, functional tools, Petri nets (their use in describing and analyzing systems), SFC (their use in the description of the command), optimization methods and scheduling resources.


Introduction to automated manufacturing systems (AMS)
Automation feature
Architecture and running principle
Functional specifications of a real-time process control system:
• What are the needs for automation
• Functional approach, structured and down
• specification languages?? (SADT)
Tools for the design of industrial automation:
• Sequential systems, state notions, parallelism, synchronization
• Petri nets, historical, autonomous networks, time delay, interpreted
• Validation, verification properties
• high level Petri nets
• From RdP to Grafcet
• Rules of evolution
• Nature of activities
• Nature of receptivity
• Synchronization Techniques
• Forcing
• Implementation
Methods for the Design of Real Time Automation, SART:
• Functional approach
• Concept of Events, (Trigger, Enable, Disable)
• Shared memory
• Centralization and / or distribution of control
• Definition of hardware interfaces
Optimization and Scheduling:
• Notations, Representation of solutions and the concept of criterion
• Algorithmic complexity and complexity theory
• Problems with a machine
Algorithms list
Notion of terminals and upper and lower
Concept of greedy algorithm
Concept of heuristics
Branch & Bound
• Problems with parallel machines
Algorithms list
Notion of performance of an algorithm and a solution
Introduction to the modeling of a scheduling problem in the form of mathematical program
• Problems workshops
Notions of dominance authorizations permutation
lower Bounds
• Robustness in Scheduling
Definitions uncertainties
Notions of flexibility, robustness, sensitivity
• Introduction to modeling in the form of mathematical programming and the use of a solver


M4, M6, M5 et M1


DS 2h + CC TP

CC 50% + CT 50%


The course exists in the following branches:

see the course schedule for 2019-2020

Additional Information

Course ID : 4EUS3SCE
Course language(s): FR

You can find this course among all other courses.

A+Augmenter la taille du texteA-Réduire la taille du texteImprimer le documentEnvoyer cette page par mail cet article Facebook Twitter Linked In

Date of update February 8, 2017

Université Grenoble Alpes