Supervisory Control and Scheduling of Resource Allocation Systems
From MaRDI portal
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Research exposition (monographs, survey articles) pertaining to systems and control theory (93-02) Attainable sets, reachability (93B03)
Recommendations
- Supervisory control for real-time scheduling of periodic and sporadic tasks with resource constraints
- Supervisory control of timed event graphs with partial specifications
- Supervisory control of extended timed event graphs
- Supervisory Control of Partially Observable Marked Graphs
- MULTIPROCESSOR SCHEDULING IN SUPERVISORY CONTROL OF DISCRETE-EVENT SYSTEMS FRAMEWORK
- Supervisory control of marked graphs with partial observations
- scientific article; zbMATH DE number 4101059
- Optimal supervisory control of discrete event systems: cyclicity and interleaving of tasks
- Supervisory Control and Measurement Scheduling for Discrete-Time Linear Systems
Cited in
(3)- Robust control reconfiguration of resource allocation systems with Petri nets and integer programming
- Robust liveness enforcement of Petri nets with uncontrollable and unobservable transitions based on structural analysis
- Scheduling AMSs with generalized Petri nets and highly informed heuristic search
This page was built for publication: Supervisory Control and Scheduling of Resource Allocation Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964676)
