Borrow it
Coverart for item
The Resource Discrete event systems in dioid algebra and conventional algebra, Philippe Declerck

Discrete event systems in dioid algebra and conventional algebra, Philippe Declerck

Work
Publication
Extent
viii, 155 p.
Contents
  • Scientific context
  • (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.
  • 1.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.
  • Dioids
  • Existence
  • 4.4.3.
  • Structure
  • 4.5.
  • Algorithm
  • 4.6.
  • Example
  • 4.6.1.
  • Models
  • 4.6.2.
  • 1.3.2.
  • Fixed-point formulation
  • 4.6.3.
  • Existence
  • 4.6.4.
  • Optimal control with specifications
  • 4.6.5.
  • Initial conditions
  • 4.7.
  • Conclusion
  • ch. 5
  • Petri nets
  • 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.
  • 1.3.3.
  • 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.
  • Time and algebraic models
  • 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.
  • 1.4.
  • Kleene star of the block tri-diagonal matrix and formal expressions of the sub-matrices
  • 5.6.
  • Conclusion
  • Organization of the book
  • ch. 2
  • Machine generated contents note:
  • Consistency
  • 2.1.
  • Introduction
  • 2.1.1.
  • Models
  • 2.1.2.
  • Physical point of view
  • 2.1.3.
  • Objectives
  • 2.2.
  • ch. 1
  • 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.
  • Introduction
  • 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.
  • 1.1.
  • 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.
  • General introduction
  • Conclusion
  • ch. 3
  • Cycle Time
  • 3.1.
  • Objectives
  • 3.2.
  • Problem without optimization
  • 3.2.1.
  • Objective
  • 3.2.2.
  • 1.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.
  • History and three mainstays
  • Example continued
  • 3.3.
  • Optimization
  • 3.3.1.
  • Approach 1
  • 3.3.2.
  • Example continued
  • 3.3.3.
  • Approach 2
  • 3.4.
  • 1.3.
  • Conclusion
  • 3.5.
  • Appendix
  • ch. 4
  • Control with Specifications
  • 4.1.
  • Introduction
  • 4.2.
  • Time interval systems
  • 4.2.1.
Isbn
9781848214613
Instance
Label
Discrete event systems in dioid algebra and conventional algebra
Title
Discrete event systems in dioid algebra and conventional algebra
Statement of responsibility
Philippe Declerck
Creator
Subject
Language
eng
Member of
Cataloging source
YDXCP
http://library.link/vocab/creatorName
Clerck, Philippe de
Illustrations
illustrations
Index
index present
LC call number
QA402
LC item number
.D43 2013
Literary form
non fiction
Nature of contents
bibliography
Series statement
Focus series in automation & control
http://library.link/vocab/subjectName
  • Discrete-time systems
  • Rings (Algebra)
  • Linear programming
  • Petri nets
Label
Discrete event systems in dioid algebra and conventional algebra, Philippe Declerck
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Contents
  • Scientific context
  • (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.
  • 1.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.
  • Dioids
  • Existence
  • 4.4.3.
  • Structure
  • 4.5.
  • Algorithm
  • 4.6.
  • Example
  • 4.6.1.
  • Models
  • 4.6.2.
  • 1.3.2.
  • Fixed-point formulation
  • 4.6.3.
  • Existence
  • 4.6.4.
  • Optimal control with specifications
  • 4.6.5.
  • Initial conditions
  • 4.7.
  • Conclusion
  • ch. 5
  • Petri nets
  • 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.
  • 1.3.3.
  • 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.
  • Time and algebraic models
  • 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.
  • 1.4.
  • Kleene star of the block tri-diagonal matrix and formal expressions of the sub-matrices
  • 5.6.
  • Conclusion
  • Organization of the book
  • ch. 2
  • Machine generated contents note:
  • Consistency
  • 2.1.
  • Introduction
  • 2.1.1.
  • Models
  • 2.1.2.
  • Physical point of view
  • 2.1.3.
  • Objectives
  • 2.2.
  • ch. 1
  • 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.
  • Introduction
  • 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.
  • 1.1.
  • 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.
  • General introduction
  • Conclusion
  • ch. 3
  • Cycle Time
  • 3.1.
  • Objectives
  • 3.2.
  • Problem without optimization
  • 3.2.1.
  • Objective
  • 3.2.2.
  • 1.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.
  • History and three mainstays
  • Example continued
  • 3.3.
  • Optimization
  • 3.3.1.
  • Approach 1
  • 3.3.2.
  • Example continued
  • 3.3.3.
  • Approach 2
  • 3.4.
  • 1.3.
  • Conclusion
  • 3.5.
  • Appendix
  • ch. 4
  • Control with Specifications
  • 4.1.
  • Introduction
  • 4.2.
  • Time interval systems
  • 4.2.1.
Dimensions
24 cm.
Extent
viii, 155 p.
Isbn
9781848214613
Other physical details
ill.
System control number
  • (CaMWU)u2894018-01umb_inst
  • 2733956
  • (Sirsi) i9781848214613
  • (OCoLC)812570974
Label
Discrete event systems in dioid algebra and conventional algebra, Philippe Declerck
Publication
Bibliography note
Includes bibliographical references and index
Contents
  • Scientific context
  • (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.
  • 1.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.
  • Dioids
  • Existence
  • 4.4.3.
  • Structure
  • 4.5.
  • Algorithm
  • 4.6.
  • Example
  • 4.6.1.
  • Models
  • 4.6.2.
  • 1.3.2.
  • Fixed-point formulation
  • 4.6.3.
  • Existence
  • 4.6.4.
  • Optimal control with specifications
  • 4.6.5.
  • Initial conditions
  • 4.7.
  • Conclusion
  • ch. 5
  • Petri nets
  • 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.
  • 1.3.3.
  • 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.
  • Time and algebraic models
  • 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.
  • 1.4.
  • Kleene star of the block tri-diagonal matrix and formal expressions of the sub-matrices
  • 5.6.
  • Conclusion
  • Organization of the book
  • ch. 2
  • Machine generated contents note:
  • Consistency
  • 2.1.
  • Introduction
  • 2.1.1.
  • Models
  • 2.1.2.
  • Physical point of view
  • 2.1.3.
  • Objectives
  • 2.2.
  • ch. 1
  • 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.
  • Introduction
  • 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.
  • 1.1.
  • 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.
  • General introduction
  • Conclusion
  • ch. 3
  • Cycle Time
  • 3.1.
  • Objectives
  • 3.2.
  • Problem without optimization
  • 3.2.1.
  • Objective
  • 3.2.2.
  • 1.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.
  • History and three mainstays
  • Example continued
  • 3.3.
  • Optimization
  • 3.3.1.
  • Approach 1
  • 3.3.2.
  • Example continued
  • 3.3.3.
  • Approach 2
  • 3.4.
  • 1.3.
  • Conclusion
  • 3.5.
  • Appendix
  • ch. 4
  • Control with Specifications
  • 4.1.
  • Introduction
  • 4.2.
  • Time interval systems
  • 4.2.1.
Dimensions
24 cm.
Extent
viii, 155 p.
Isbn
9781848214613
Other physical details
ill.
System control number
  • (CaMWU)u2894018-01umb_inst
  • 2733956
  • (Sirsi) i9781848214613
  • (OCoLC)812570974

Subject

Member of

Library Locations

  • Albert D. Cohen Management LibraryBorrow it
    181 Freedman Crescent, Winnipeg, MB, R3T 5V4, CA
    49.807878 -97.129961
  • Architecture/Fine Arts LibraryBorrow it
    84 Curry Place, Winnipeg, MB, CA
    49.807716 -97.136226
  • Archives and Special CollectionsBorrow it
    25 Chancellors Circle (Elizabeth Dafoe Library), Room 330, Winnipeg, MB, R3T 2N2, CA
    49.809961 -97.131878
  • Bibliothèque Alfred-Monnin (Université de Saint-Boniface)Borrow it
    200, avenue de la Cathédrale, Local 2110, Winnipeg, MB, R2H 0H7, CA
    49.888861 -97.119735
  • Bill Larson Library (Grace Hospital)Borrow it
    300 Booth Drive, G-227, Winnipeg, MB, R3J 3M7, CA
    49.882400 -97.276436
  • Carolyn Sifton - Helene Fuld Library (St. Boniface General Hospital)Borrow it
    409 Tache Avenue, Winnipeg, MB, R2H 2A6, CA
    49.883388 -97.126050
  • Concordia Hospital LibraryBorrow it
    1095 Concordia Avenue, Winnipeg, MB, R2K 3S8, CA
    49.913252 -97.064683
  • Donald W. Craik Engineering LibraryBorrow it
    75B Chancellors Circle (Engineering Building E3), Room 361, Winnipeg, MB, R3T 2N2, CA
    49.809053 -97.133292
  • E.K. Williams Law LibraryBorrow it
    224 Dysart Road, Winnipeg, MB, R3T 5V4, CA
    49.811829 -97.131017
  • Eckhardt-Gramatté Music LibraryBorrow it
    136 Dafoe Road (Taché Arts Complex), Room 257, Winnipeg, MB, R3T 2N2, CA
    49.807964 -97.132222
  • Elizabeth Dafoe LibraryBorrow it
    25 Chancellors Circle, Winnipeg, MB, R3T 2N2, CA
    49.809961 -97.131878
  • Fr. H. Drake Library (St. Paul's College)Borrow it
    70 Dysart Road, Winnipeg, MB, R3T 2M6, CA
    49.810605 -97.138184
  • J.W. Crane Memorial Library (Deer Lodge Centre)Borrow it
    2109 Portage Avenue, Winnipeg, MB, R3J 0L3, CA
    49.878000 -97.235520
  • Libraries Annex (not open to the public; please see web page for details)Borrow it
    25 Chancellors Circle (in the Elizabeth Dafoe Library), Winnipeg, MB, R3T 2N2, CA
    49.809961 -97.131878
  • Neil John Maclean Health Sciences LibraryBorrow it
    727 McDermot Avenue (Brodie Centre), 200 Level, Winnipeg, MB, R3E 3P5, CA
    49.903563 -97.160554
  • Sciences and Technology LibraryBorrow it
    186 Dysart Road, Winnipeg, MB, R3T 2M8, CA
    49.811526 -97.133257
  • Seven Oaks General Hospital LibraryBorrow it
    2300 McPhillips Street, Winnipeg, MB, R2V 3M3, CA
    49.955177 -97.148865
  • Sister St. Odilon Library (Misericordia Health Centre)Borrow it
    99 Cornish Avenue, Winnipeg, MB, R3C 1A2, CA
    49.879592 -97.160425
  • St. John's College LibraryBorrow it
    92 Dysart Road, Winnipeg, MB, R3T 2M5, CA
    49.811242 -97.137156
  • Victoria General Hospital LibraryBorrow it
    2340 Pembina Highway, Winnipeg, MB, R3T 2E8, CA
    49.806755 -97.152739
  • William R Newman Library (Agriculture)Borrow it
    66 Dafoe Road, Winnipeg, MB, R3T 2R3, CA
    49.806936 -97.135525

Library Links

Zepheira Logo
Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by University of Manitoba Libraries. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...