Discrete Event Systems in Dioid Algebra and Conventional Algebra 1st Edition by Philippe Declerck – Ebook PDF Instant Download/Delivery: 1848214618, 978-1848214613
Full download Discrete Event Systems in Dioid Algebra and Conventional Algebra 1st Edition after payment

Product details:
ISBN 10: 1848214618
ISBN 13: 978-1848214613
Author: Philippe Declerck
This book concerns the use of dioid algebra as (max, +) algebra to treat the synchronization of tasks expressed by the maximum of the ends of the tasks conditioning the beginning of another task – a criterion of linear programming. A classical example is the departure time of a train which should wait for the arrival of other trains in order to allow for the changeover of passengers.
The content focuses on the modeling of a class of dynamic systems usually called “discrete event systems” where the timing of the events is crucial. Events are viewed as sudden changes in a process which is, essentially, a man-made system, such as automated manufacturing lines or transportation systems. Its main advantage is its formalism which allows us to clearly describe complex notions and the possibilities to transpose theoretical results between dioids and practical applications.
Table of contents:
Chapter 1. Introduction
1.1. General introduction
1.2. History and three mainstays
1.3. Scientific context
1.3.1. Dioids
1.3.2. Petri nets
1.3.3. Time and algebraic models
1.4. Organization of the book
Chapter 2. Consistency
2.1. Introduction
2.1.1. Models
2.1.2. Physical point of view
2.1.3. Objectives
2.2. Preliminaries
2.3. Models and principle of the approach
2.3.1. P-time event graphs
2.3.2. Dater form
2.3.3. Principle of the approach (Example 2)
2.4. Analysis in the “static” case
2.5. “Dynamic” model
2.6. Extremal acceptable trajectories by series of matrices
2.6.1. Lowest state trajectory
2.6.2. Greatest state trajectory
2.7. Consistency
2.7.1. Example 3
2.7.2. Maximal horizon of temporal consistency
2.7.3. Date of the first token deaths
2.7.4. Computational complexity
2.8. Conclusion
Chapter 3. Cycle Time
3.1. Objectives
3.2. Problem without optimization
3.2.1. Objective
3.2.2. Matrix expression of a P-time event graph
3.2.3. Matrix expression of P-time event graphs with interdependent residence durations
3.2.4. General form Ax ≤ b
3.2.5. Example
3.2.6. Existence of a 1-periodic behavior
3.2.7. Example continued
3.3. Optimization
3.3.1. Approach 1
3.3.2. Example continued
3.3.3. Approach 2
3.4. Conclusion
3.5. Appendix
Chapter 4. Control with Specifications
4.1. Introduction
4.2. Time interval systems
4.2.1. (min, max, +) algebraic models
4.2.2. Timed event graphs
4.2.3. P-time event graphs
4.2.4. Time stream event graphs
4.3. Control synthesis
4.3.1. Problem
4.3.2. Pedagogical example: education system
4.3.3. Algebraic models
4.4. Fixed-point approach
4.4.1. Fixed-point formulation
4.4.2. Existence
4.4.3. Structure
4.5. Algorithm
4.6. Example
4.6.1. Models
4.6.2. Fixed-point formulation
4.6.3. Existence
4.6.4. Optimal control with specifications
4.6.5. Initial conditions
4.7. Conclusion
Chapter 5. Online Aspect of Predictive Control
5.1. Introduction
5.1.1. Problem
5.1.2. Specific characteristics
5.2. Control without desired output (Problem 1)
5.2.1. Objective
5.2.2. Example 1
5.2.3. Trajectory description
5.2.4. Relaxed system
5.3. Control with desired output (Problem 2)
5.3.1. Objective
5.3.2. Fixed-point form
5.3.3. Relaxed system
5.4. Control on a sliding horizon (Problem 3): online and offline aspects
5.4.1. CPU time of the online control
5.5. Kleene star of the block tri-diagonal matrix and formal expressions of the sub-matrices
5.6. Conclusion
People also search for:
discrete event systems in dioid algebra
discrete event systems
discrete event simulation algorithm
discrete event dynamic systems
discrete events examples
Tags:
Philippe Declerck,Discrete Event,Systems in Dioid Algebra,and Conventional Algebra