Extremal solutions of inequations over lattices with applications to supervisory control
From MaRDI portal
Publication:672379
DOI10.1016/0304-3975(94)00256-IzbMath0873.68002MaRDI QIDQ672379
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (4)
Efficient robust supervisors for discrete event systems ⋮ A characterization of realizable behavior in supervisory control of timed event graphs ⋮ Maximizing robustness of supervisors for partially observed discrete event systems. ⋮ Maximally permissive mutually and globally nonblocking supervision with application to switching control
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Formulas for calculating supremal controllable and normal sublanguages
- Fixed points of increasing functions
- Optimal fixedpoints of logic programs
- On observability of discrete-event systems
- Fixed point theorems and semantics: A folk tale
- On controllability and normality of discrete event dynamical systems
- The convergence of functions to fixedpoints of recursive definitions
- The infimal prefix-closed and observable superlanguage of a given language
- Continuously generated fixed points
- A lattice-theoretical fixpoint theorem and its applications
- The infimal closed controllable superlanguage and its application in supervisory control
- Supervisory Control of a Class of Discrete Event Processes
- Supervisory control of discrete-event processes with partial observations
- Data Types as Lattices
- The Theoretical Aspects of the Optimal Fixedpoint
- Predicates and predicate transformers for supervisory control of discrete event dynamical systems
This page was built for publication: Extremal solutions of inequations over lattices with applications to supervisory control
