Supervisory Control Theory with Event Forcing

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Reniers, Michel, Cai, Kai
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917638472466432
author Reniers, Michel
Cai, Kai
author_facet Reniers, Michel
Cai, Kai
contents In the Ramadge-Wonham supervisory control theory the only interaction mechanism between supervisor and plant is that the supervisor may enable/disable events from the plant and the plant makes a final decision about which of the enabled events is actually taking place. In this paper, the interaction between supervisor and plant is enriched by allowing the supervisor to force specific events (called forcible events) that are allowed to preempt uncontrollable events. A notion of forcible-controllability is defined that captures the interplay between controllability of a supervisor w.r.t. the uncontrollable events provided by a plant in the setting with event forcing. Existence of a maximally permissive, forcibly-controllable, nonblocking supervisor is shown and an algorithm is provided that computes such a supervisor. The approach is illustrated by two small case studies.
format Preprint
id arxiv_https___arxiv_org_abs_2404_08469
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Supervisory Control Theory with Event Forcing
Reniers, Michel
Cai, Kai
Formal Languages and Automata Theory
Systems and Control
In the Ramadge-Wonham supervisory control theory the only interaction mechanism between supervisor and plant is that the supervisor may enable/disable events from the plant and the plant makes a final decision about which of the enabled events is actually taking place. In this paper, the interaction between supervisor and plant is enriched by allowing the supervisor to force specific events (called forcible events) that are allowed to preempt uncontrollable events. A notion of forcible-controllability is defined that captures the interplay between controllability of a supervisor w.r.t. the uncontrollable events provided by a plant in the setting with event forcing. Existence of a maximally permissive, forcibly-controllable, nonblocking supervisor is shown and an algorithm is provided that computes such a supervisor. The approach is illustrated by two small case studies.
title Supervisory Control Theory with Event Forcing
topic Formal Languages and Automata Theory
Systems and Control
url https://arxiv.org/abs/2404.08469