Extremal solutions of inequations over lattices with applications to supervisory control

DOI10.1016/0304-3975(94)00256-IzbMATH Open0873.68002MaRDI QIDQ672379FDOQ672379

Authors: Ratnesh Kumar, Vijay K. Garg 

Publication date: 28 February 1997

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

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

zbMATH Keywords

supervisorslogical discrete event systems

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Cites Work

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

Cited In (4)

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

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)