Extremal solutions of inequations over lattices with applications to supervisory control
type: Item
instance of: scholarly article
title: Extremal solutions of inequations over lattices with applications to supervisory control
zbMATH Open document ID: 0873.68002
DOI: 10.1016/0304-3975(94)00256-I
author: Ratnesh Kumar
author: Vijay K. Garg
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68M07
zbMATH DE Number: 984956
zbMATH Keywords: logical discrete event systems
zbMATH Keywords: supervisors
MaRDI profile type: Publication
cites work: Continuously generated fixed points
cites work: Formulas for calculating supremal controllable and normal sublanguages
cites work: Supervisory control of discrete-event processes with partial observations
cites work: Q4692885
cites work: Q4692630
cites work: Q4168046
cites work: Fixed points of increasing functions
cites work: Q5592246
cites work: Q4840936
cites work: On controllability and normality of discrete event dynamical systems
cites work: Predicates and predicate transformers for supervisory control of discrete event dynamical systems
cites work: The infimal closed controllable superlanguage and its application in supervisory control
cites work: Optimal fixedpoints of logic programs
cites work: Fixed point theorems and semantics: A folk tale
cites work: On observability of discrete-event systems
cites work: The Theoretical Aspects of the Optimal Fixedpoint
cites work: The convergence of functions to fixedpoints of recursive definitions
cites work: Supervisory Control of a Class of Discrete Event Processes
cites work: The infimal prefix-closed and observable superlanguage of a given language
cites work: Data Types as Lattices
cites work: A lattice-theoretical fixpoint theorem and its applications
description: scientific article; zbMATH DE number 984956