Extremal solutions of inequations over lattices with applications to supervisory control

DOI10.1016/0304-3975(94)00256-IMaRDI QIDQ672379zbMATH OpenFDO

Authors Ratnesh Kumar, Vijay K. Garg

Publication date 28 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

supervisorslogical discrete event systems

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• Supremum Operators and Computation of Supremal Elements in System Theory
• Maximal Solutions in Decentralized Supervisory Control
• The infimal closed controllable superlanguage and its application in supervisory control
• Supervisory control of real-time discrete-event systems using lattice theory

Cites work

• scientific article; zbMATH DE number 3602653 (Why is no real title available?)
• scientific article; zbMATH DE number 194642 (Why is no real title available?)
• scientific article; zbMATH DE number 194916 (Why is no real title available?)
• scientific article; zbMATH DE number 781092 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• A lattice-theoretical fixpoint theorem and its applications
• Continuously generated fixed points
• Data Types as Lattices
• Fixed point theorems and semantics: A folk tale
• Fixed points of increasing functions
• Formulas for calculating supremal controllable and normal sublanguages
• On controllability and normality of discrete event dynamical systems
• On observability of discrete-event systems
• Optimal fixedpoints of logic programs
• Predicates and predicate transformers for supervisory control of discrete event dynamical systems
• Supervisory Control of a Class of Discrete Event Processes
• Supervisory control of discrete-event processes with partial observations
• The Theoretical Aspects of the Optimal Fixedpoint
• The convergence of functions to fixedpoints of recursive definitions
• The infimal closed controllable superlanguage and its application in supervisory control
• The infimal prefix-closed and observable superlanguage of a given language

Cited in

(4)

• Maximally permissive mutually and globally nonblocking supervision with application to switching control
• A characterization of realizable behavior in supervisory control of timed event graphs
• Maximizing robustness of supervisors for partially observed discrete event systems.
• Efficient robust supervisors for discrete event systems

This page was built for publication: Extremal solutions of inequations over lattices with applications to supervisory control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672379)