Algebraic approaches for designing control laws of time-constrained networked conflicting timed event graphs (Q2676095)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7593031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algebraic approaches for designing control laws of time-constrained networked conflicting timed event graphs |
scientific article; zbMATH DE number 7593031 |
Statements
Algebraic approaches for designing control laws of time-constrained networked conflicting timed event graphs (English)
0 references
27 September 2022
0 references
networked conflicting timed event graphs (NCTEGs)
0 references
discrete event systems (DESs)
0 references
switching max-plus linear (SMPL) systems
0 references
time constraints
0 references
closed loop control
0 references
0 references
0 references
0 references
0 references
0.8563329577445984
0 references
0.830867350101471
0 references
0.8266488313674927
0 references
0.82278972864151
0 references
