Supervisory control of deterministic Petri nets with regular specification languages
DOI10.1109/9.481527zbMATH Open0867.93045OpenAlexW2160906685MaRDI QIDQ4876593FDOQ4876593
Authors: Lawrence E. Holloway, Ratnesh Kumar 
Publication date: 13 June 1996
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/9.481527
Recommendations
- Deterministic weak-and-marked Petri net languages are regular
- Supervisory Control of Petri Nets with Language Specifications
- Blocking and controllability of Petri nets in supervisory control
- Decidability and closure properties of weak Petri net languages in supervisory control
- scientific article; zbMATH DE number 2123125
algorithmsregular languagediscrete-event systemsminimally restrictive supervisorsupervisory control theorydeterministic Petri net language
Formal languages and automata (68Q45) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (16)
- Controller synthesis with highly simplified linear constraints
- Decidability and closure properties of weak Petri net languages in supervisory control
- A class of non-deterministic specifications for supervisory control
- Supervisory control synthesis for deterministic context free specification languages. Enforcing controllability least restrictively
- Title not available (Why is that?)
- Optimal supervisor synthesis for Petri nets with uncontrollable transitions: a bottom-up algorithm
- Structural optimal control for safe Petri nets
- Supervisory Control of Petri Nets with Language Specifications
- Modeling and synthesis of supervisory control based on Petri nets for distributed objects. I. Interaction mechanism and the basic method
- Reduction of the supervisory control problem for Petri nets
- Grafcet: behavioural issues and control synthesis
- Solving the problem of forbidden states in discrete event systems: a novel systematic method for reducing the number of control places
- Supervision based on place invariants: a survey
- Blocking and controllability of Petri nets in supervisory control
- Exploiting symmetry in the synthesis of supervisors for discrete event systems
- Reduction of constraints for controller synthesis based on safe Petri nets
This page was built for publication: Supervisory control of deterministic Petri nets with regular specification languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4876593)
