{
 "id": "eprhpd92z8",
 "slug": "supervisory-control-theory",
 "title": "Supervisory control theory",
 "updated": "2026-10-15",
 "topic_path": [
  {
   "id": "technology",
   "label": "Technology and the built world",
   "api_url": "https://www.edgepedia.org/api/v1/topics/technology"
  },
  {
   "id": "technology.engineering",
   "label": "Engineering and manufacturing",
   "api_url": "https://www.edgepedia.org/api/v1/topics/technology.engineering"
  },
  {
   "id": "technology.engineering.engineering.methods.systems",
   "label": "Engineering methods and systems engineering",
   "api_url": "https://www.edgepedia.org/api/v1/topics/technology.engineering.engineering.methods.systems"
  },
  {
   "id": "technology.engineering.engineering.methods.systems.control-system-design-and-analysis-methods",
   "label": "Control system design and analysis methods",
   "api_url": "https://www.edgepedia.org/api/v1/topics/technology.engineering.engineering.methods.systems.control-system-design-and-analysis-methods"
  }
 ],
 "geo": [
  {
   "id": "geo.nongeo.t1946.technology.engineering.engineering.methods.systems",
   "label": "Non-geographic · 1946 to 2000: Engineering methods and systems engineering",
   "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.engineering.engineering.methods.systems",
   "path": [
    {
     "id": "geo.nongeo",
     "label": "Non-geographic",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo"
    },
    {
     "id": "geo.nongeo.t1946",
     "label": "Non-geographic · 1946 to 2000",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946"
    },
    {
     "id": "geo.nongeo.t1946.technology",
     "label": "Technology and the built world",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology"
    },
    {
     "id": "geo.nongeo.t1946.technology.engineering",
     "label": "Engineering and manufacturing",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.engineering"
    },
    {
     "id": "geo.nongeo.t1946.technology.engineering.engineering.methods.systems",
     "label": "Engineering methods and systems engineering",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.technology.engineering.engineering.methods.systems"
    }
   ]
  }
 ],
 "excerpt": "Supervisory control theory is a framework for automatically synthesizing a supervisor that disables controllable events so a discrete-event system meets its specification, founded by Ramadge and Wonham in 1987.",
 "snippet": "Supervisory control theory is a framework for automatically synthesizing a supervisor that disables controllable events so a discrete-event system meets its specification, founded by Ramadge and Wonham in 1987.",
 "node": "technology.engineering.engineering.methods.systems.control-system-design-and-analysis-methods",
 "markdown": "# Supervisory control theory\n\nSupervisory control theory (SCT) is a framework for automatically synthesizing a supervisor, from a model of an uncontrolled plant and a model of the desired behavior, so that the closed-loop system satisfies the specification. It is used for discrete-event systems, processes that are discrete, asynchronous, and possibly nondeterministic.<sup>[1](https://link.springer.com/article/10.1007/s10626-024-00408-z)</sup> The output is an automaton, equivalently a function that dynamically disables controllable events, placed in feedback with the plant so the closed-loop system obeys the specified behavior.<sup>[2](https://arxiv.org/pdf/2007.05795)</sup>\n\n| Key fact | Value |\n|---|---|\n| Founding journal paper | Ramadge and Wonham, *SIAM Journal on Control and Optimization* 25(1):206–230, 1987<sup>[3](https://epubs.siam.org/doi/10.1137/0325013)</sup> |\n| Control mechanism | Partition of events into controllable (disableable) and uncontrollable events<sup>[4](https://www.control.toronto.edu/~wonham/Wonham_ARC_SCDES-brief-history.pdf)</sup> |\n| Synthesis guarantees | Safety, controllability, nonblockingness, maximal permissiveness<sup>[5](https://eclipse.dev/escet/v12.0/sbe-course/module3/synthesis-guarantees.html)</sup> |\n| Core object | Supremal controllable sublanguage, the largest achievable sub-behavior<sup>[6](https://link.springer.com/article/10.1007/s10626-023-00378-8)</sup> |\n| State explosion | N machines with k states each yield roughly \\( k^{N} \\) states; 10 machines with 5 states give about 10 million states<sup>[4](https://www.control.toronto.edu/~wonham/Wonham_ARC_SCDES-brief-history.pdf)</sup> |\n| Complexity | Polynomial in composed states; NP in the number of components; modular nonblocking verification PSPACE-complete<sup>[6](https://link.springer.com/article/10.1007/s10626-023-00378-8)</sup> |\n| Tools | CIF (Eclipse ESCET), libFAUDES, Supremica<sup>[7](https://eclipse.dev/escet/v12.0/sbe-course/module3/supervisory-controller-synthesis.html)</sup> |\n\n## How it works\n\nThe plant is modeled as a generator, a quintuple \\( G = (Q, \\Sigma, f, q_{0}, Q_{m}) \\) with finite state set \\( Q \\), event set \\( \\Sigma \\), partial transition function \\( f \\), initial state \\( q_{0} \\), and marked states \\( Q_{m} \\); its external behavior is the regular language \\( L(G) \\), with marked language \\( L_{m}(G) \\).<sup>[8](https://users.math.cas.cz/~masopust/pubs/Preprint/scdes01.pdf)</sup>\n\nControl is disablement: the event set is partitioned into controllable events, which the supervisor can prevent from occurring, and uncontrollable events, which it must leave untouched whenever the plant enables them.<sup>[1](https://link.springer.com/article/10.1007/s10626-024-00408-z)</sup> Formally, a supervisor is a map \\( S: L(G) \\to \\Gamma \\) into control patterns \\( \\gamma \\subseteq \\Sigma \\) with \\( \\Sigma_{u} \\subseteq \\gamma \\), so it can never disable a transition under an uncontrollable event.<sup>[8](https://users.math.cas.cz/~masopust/pubs/Preprint/scdes01.pdf)</sup>\n\nA specification language \\( K \\) can be achieved by a supervisor if and only if it is controllable with respect to \\( L \\) and the uncontrollable set \\( \\Sigma_{u} \\), written \\( \\overline{K} \\Sigma_{u} \\cap L \\subseteq \\overline{K} \\), where \\( \\overline{K} \\) denotes prefix closure (this simplifies to \\( K \\Sigma_{u} \\cap L \\subseteq K \\) when \\( K \\) is prefix-closed), and \\( K \\) and \\( L \\) are nonconflicting, written \\( \\mathrm{Pre}(K) \\cap \\mathrm{Pre}(L) = \\mathrm{Pre}(K \\cap L) \\).<sup>[6](https://link.springer.com/article/10.1007/s10626-023-00378-8)</sup> For a nonblocking supervisor, \\( K \\) must additionally be \\( L_{m}(G) \\)-closed.<sup>[8](https://users.math.cas.cz/~masopust/pubs/Preprint/scdes01.pdf)</sup> The controllable sublanguages of a specification admit a unique maximal element, the supremal controllable sublanguage \\( \\mathrm{sup}\\,C \\), which is again controllable and nonconflicting and represents the maximally permissive solution.<sup>[4](https://www.control.toronto.edu/~wonham/Wonham_ARC_SCDES-brief-history.pdf)</sup><sup> • </sup><sup>[6](https://link.springer.com/article/10.1007/s10626-023-00378-8)</sup>\n\n## How it is done\n\nA practitioner models the plant components and each requirement as automata, composes them, and computes the supremal controllable sublanguage. The classical computation is a fixed-point iteration: for regular languages the supremum \\( \\sup C \\) is the limit of the finite sequence \\( K_{j+1} = \\Omega(K_{j}) \\) with \\( K_{0} = K \\), where \\( \\Omega \\) is a monotone operator that removes states violating controllability.<sup>[9](https://epubs.siam.org/doi/10.1137/0325036)</sup> In automata terms, synthesis starts from the uncontrolled plant and repeats: remove blocking states, remove non-controllable states (states with an uncontrollable-event transition to a bad state), optionally remove unreachable states, and disable controllable-event transitions leading to bad states.<sup>[7](https://eclipse.dev/escet/v12.0/sbe-course/module3/supervisory-controller-synthesis.html)</sup> Badness propagates backwards through uncontrollable transitions, since the supervisor cannot intervene there.<sup>[5](https://eclipse.dev/escet/v12.0/sbe-course/module3/synthesis-guarantees.html)</sup>\n\nThe synthesis step guarantees by construction that the closed-loop behavior is safe, controllable, nonblocking, and maximally permissive.<sup>[10](https://www.sciencedirect.com/science/article/pii/S0967066121001076)</sup> Some model properties make synthesis unnecessary: if a dependency graph between plant and requirement models is acyclic, the models already form a controllable, nonblocking, maximally permissive supervisor.<sup>[10](https://www.sciencedirect.com/science/article/pii/S0967066121001076)</sup>\n\nTools include the CIF tool of Eclipse ESCET, which computes the supervisor directly from multiple automata without first constructing the full state space;<sup>[7](https://eclipse.dev/escet/v12.0/sbe-course/module3/supervisory-controller-synthesis.html)</sup> libFAUDES, whose synthesis enforces that the closed loop evolves within the specified behavior, corresponding to the controllability condition of Ramadge and Wonham;<sup>[11](https://fgdes.tf.fau.de/faudes/reference/synthesis_index.html)</sup> and Supremica, which handles large state spaces through modularity and BDD-based symbolic representation and implements monolithic and modular algorithms for nonblocking, controllability, and combined problems.<sup>[12](https://doi.org/10.1109/wodes.2006.382401)</sup>\n\n## Origin\n\nThe theory arose in response to a 1980 request for a control theory for discrete-event systems. The response modeled the plant internally as a finite state machine whose external behavior is a regular language.<sup>[4](https://www.control.toronto.edu/~wonham/Wonham_ARC_SCDES-brief-history.pdf)</sup> The key theoretical ingredient was the concept of controllable language, together with the fact that controllable sublanguages admit a unique supremal element.<sup>[4](https://www.control.toronto.edu/~wonham/Wonham_ARC_SCDES-brief-history.pdf)</sup><sup> • </sup><sup>[3](https://epubs.siam.org/doi/10.1137/0325013)</sup> From the mid-1980s onward, researchers built on this work, and the resulting theory became known as supervisory control theory.<sup>[13](https://www.eolss.net/sample-chapters/c18/E6-43-27-02.pdf)</sup>\n\n## Variants\n\nSeveral architectures exploit system structure to ease supervisor design: modular, hierarchical, concurrent, and decentralized supervisory control.<sup>[6](https://link.springer.com/article/10.1007/s10626-023-00378-8)</sup> Modular supervisory control of discrete-event systems was published by W. M. Wonham and P. J. Ramadge in *Mathematics of Control Signals and Systems* in 1988.<sup>[14](https://doi.org/10.1007/bf02551233)</sup> In modular synthesis, one control problem is solved per requirement; the collection of supervisors can be conflicting, in which case a coordinator is synthesized.<sup>[10](https://www.sciencedirect.com/science/article/pii/S0967066121001076)</sup> Decentralized supervisors enforce local specifications separately; in benign cases they cooperate to match the monolithic supervisor, but in general they are \"myopic\" and their conflict may lead to livelock. Published attributions differ: one historical account credits decentralized supervision,<sup>[4](https://www.control.toronto.edu/~wonham/Wonham_ARC_SCDES-brief-history.pdf)</sup> while a 2023 survey credits decentralized supervisory control;<sup>[6](https://link.springer.com/article/10.1007/s10626-023-00378-8)</sup> the discrepancy is unresolved.\n\nUnder partial observation through a natural projection \\( P \\), a language can be feasibly synthesized if and only if it is both controllable and observable.<sup>[15](https://www.caikai.org/publication/CaiWonham_20Encyclo.pdf)</sup> Relative observability, published by Kai Cai, Renyuan Zhang, and W. M. Wonham in *IEEE Transactions on Automatic Control* in 2016 (volume 61, no. 11), is weaker than normality but stronger than observability.<sup>[16](https://doi.org/10.1109/tac.2015.2513370)</sup><sup> • </sup><sup>[15](https://www.caikai.org/publication/CaiWonham_20Encyclo.pdf)</sup> The theory has also been extended to timed and stochastic models of discrete-event systems.<sup>[13](https://www.eolss.net/sample-chapters/c18/E6-43-27-02.pdf)</sup>\n\n## Applications\n\nDocumented case studies include a production line and a roadway tunnel.<sup>[10](https://www.sciencedirect.com/science/article/pii/S0967066121001076)</sup> Adoption is limited: realistic industrial applications remain few in number, due in part to a lack of experience among control engineers with modeling and specification in the automata framework.<sup>[4](https://www.control.toronto.edu/~wonham/Wonham_ARC_SCDES-brief-history.pdf)</sup>\n\n## Limitations and alternatives\n\nThe central limitation is exponential state space explosion: the supervisor's state size grows on the order of the product of plant and specification state sizes, addressed by decentralized and hierarchical architectures and by symbolic representation.<sup>[15](https://www.caikai.org/publication/CaiWonham_20Encyclo.pdf)</sup> A workcell with \\( N \\) machines of \\( k \\) states each yields a plant with roughly \\( k^{N} \\) states, so 10 machines with 5 states give about 10 million states.<sup>[4](https://www.control.toronto.edu/~wonham/Wonham_ARC_SCDES-brief-history.pdf)</sup> A straightforward monolithic algorithm verifies a property or synthesizes a supervisor in time polynomial in the number of states of the composed system, but that number is exponential in the number of components: \\( N \\) components with \\( k \\) states each compose to at most \\( k^{N} \\) states.<sup>[6](https://link.springer.com/article/10.1007/s10626-023-00378-8)</sup> Gohari and Wonham (2000) showed that standard supervisory control problems are NP-hard when measured by the number of components, so a polynomial-time algorithm is unlikely unless P equals NP.<sup>[6](https://link.springer.com/article/10.1007/s10626-023-00378-8)</sup> Verifying nonblockingness of modular supervisors is in general PSPACE-complete, becoming NP-complete with a single shared event.<sup>[1](https://link.springer.com/article/10.1007/s10626-024-00408-z)</sup> Binary decision diagrams (BDDs) were carried over to supervisor synthesis.<sup>[1](https://link.springer.com/article/10.1007/s10626-024-00408-z)</sup> Compositional methods, including local synthesis, projection with deterministic abstractions, and nondeterministic abstractions, can solve problems of industrial scale.<sup>[6](https://link.springer.com/article/10.1007/s10626-023-00378-8)</sup> A related alternative is reactive (game-based) synthesis; a comparative study makes the connection between supervisory control and [reactive synthesis](https://www.edgepedia.org/reactive-synthesis) mathematically precise for non-expert readers.<sup>[17](https://dl.acm.org/doi/10.1007/s10626-015-0223-0)</sup>\n\n## References\n\n1. [Offline supervisory control synthesis: taxonomy and recent developments (Discrete Event Dynamic Systems, 2024)](https://link.springer.com/article/10.1007/s10626-024-00408-z)\n2. [arXiv paper using supervisory control theory](https://arxiv.org/pdf/2007.05795)\n3. [Supervisory Control of a Class of Discrete Event Processes (Ramadge & Wonham, SIAM Journal on Control and Optimization, 1987)](https://epubs.siam.org/doi/10.1137/0325013)\n4. [Supervisory control of discrete-event systems: A brief history (Wonham)](https://www.control.toronto.edu/~wonham/Wonham_ARC_SCDES-brief-history.pdf)\n5. [SBE Course Module 3.2: Synthesis guarantees (Eclipse ESCET)](https://eclipse.dev/escet/v12.0/sbe-course/module3/synthesis-guarantees.html)\n6. [A survey on compositional algorithms for verification and synthesis in supervisory control (Discrete Event Dynamic Systems, 2023)](https://link.springer.com/article/10.1007/s10626-023-00378-8)\n7. [SBE Course Module 3.3: Supervisory controller synthesis (Eclipse ESCET)](https://eclipse.dev/escet/v12.0/sbe-course/module3/supervisory-controller-synthesis.html)\n8. [Supervisory Control of Discrete-Event Systems (Komenda and Masopust)](https://users.math.cas.cz/~masopust/pubs/Preprint/scdes01.pdf)\n9. [On the Supremal Controllable Sublanguage of a Given Language (SIAM Journal on Control and Optimization)](https://epubs.siam.org/doi/10.1137/0325036)\n10. [Model properties for efficient synthesis of nonblocking modular supervisors (Goorden et al., Computers in Industry)](https://www.sciencedirect.com/science/article/pii/S0967066121001076)\n11. [libFAUDES reference: Synthesis](https://fgdes.tf.fau.de/faudes/reference/synthesis_index.html)\n12. [Supremica - An integrated environment for verification, synthesis and simulation of discrete event systems](https://doi.org/10.1109/wodes.2006.382401)\n13. [Supervisory Control of Discrete Event Systems (Cassandras and Lafortune textbook chapter)](https://www.eolss.net/sample-chapters/c18/E6-43-27-02.pdf)\n14. [W. M. Wonham, P. J. Ramadge (1988). Modular supervisory control of discrete-event systems. Mathematics of Control Signals and Systems.](https://doi.org/10.1007/bf02551233)\n15. [Supervisory Control of Discrete-Event Systems (Cai and Wonham, encyclopedia chapter)](https://www.caikai.org/publication/CaiWonham_20Encyclo.pdf)\n16. [Kai Cai, Renyuan Zhang, W. M. Wonham (2015). Relative Observability and Coobservability of Timed Discrete-Event Systems. IEEE Transactions on Automatic Control.](https://doi.org/10.1109/tac.2015.2513370)\n17. [Supervisory control and reactive synthesis: a comparative introduction (Discrete Event Dynamic Systems)](https://dl.acm.org/doi/10.1007/s10626-015-0223-0)\n\n---\n*Topic: Encyclopedia › Technology and the built world › Engineering and manufacturing › Engineering methods and systems engineering › Control system design and analysis methods*\n\n*Initially written Sep 29, 2026 · Edited: Oct 15, 2026*\n\n*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*\n\nLicense: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license\n",
 "same_as": [
  "https://www.control.toronto.edu/~wonham/Wonham_ARC_SCDES-brief-history.pdf"
 ],
 "url": "https://www.edgepedia.org/supervisory-control-theory",
 "markdown_url": "https://www.edgepedia.org/supervisory-control-theory.md",
 "license": {
  "name": "Edgepedia Community License 1.0",
  "url": "https://www.edgepedia.org/edgepedia/license",
  "summary": "Free with credit, commercial use included. AI training is open to everyone. For other uses, organizations over USD 100M in revenue or 100M monthly users license separately.",
  "spdx": "LicenseRef-Edgepedia-Community-1.0"
 },
 "credit": "\"Supervisory control theory\", Edgepedia (EdgeChat), https://www.edgepedia.org/supervisory-control-theory. Edgepedia Community License 1.0.",
 "credit_md": "\"[Supervisory control theory](https://www.edgepedia.org/supervisory-control-theory)\", Edgepedia (EdgeChat), [https://www.edgepedia.org/supervisory-control-theory](https://www.edgepedia.org/supervisory-control-theory). [Edgepedia Community License 1.0](https://www.edgepedia.org/edgepedia/license).",
 "credit_html": "\"<a href=\"https://www.edgepedia.org/supervisory-control-theory\">Supervisory control theory</a>\", Edgepedia (EdgeChat), <a href=\"https://www.edgepedia.org/supervisory-control-theory\">https://www.edgepedia.org/supervisory-control-theory</a>. <a href=\"https://www.edgepedia.org/edgepedia/license\">Edgepedia Community License 1.0</a>.",
 "speakable": "Supervisory control theory is a framework for automatically synthesizing a supervisor that disables controllable events so a discrete-event system meets its specification, founded by Ramadge and Wonham in 1987."
}