Centralized and distributed algorithms for on-line synthesis of maximal control policies under partial observation

DOI10.1007/BF01797138zbMath0880.93016OpenAlexW2012427794WikidataQ115149436 ScholiaQ115149436MaRDI QIDQ2563760

Feng Lin, Nejib Ben Hadj-Alouane, Stéphane Lafortune

Publication date: 22 January 1997

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01797138

zbMATH Keywords

complexityon-line controlparallel/distributed algorithmmaximal controllable and observable sublanguagepartially observed discrete event systems

Mathematics Subject Classification ID

Hierarchical systems (93A13) Decentralized systems (93A14) Parallel numerical computation (65Y05) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items (14)

Control of parameterized discrete event systems ⋮ Near-optimal online control of dynamic discrete-event systems ⋮ Maximizing robustness of supervisors for partially observed discrete event systems. ⋮ Supervisory control of a class of Petri nets with unobservable and uncontrollable transitions ⋮ Active fault tolerant control of discrete event systems using online diagnostics ⋮ Supervisory control of a class of concurrent discrete event systems under partial observation ⋮ PSPACE-completeness of modular supervisory control problems ⋮ Opacity of discrete event systems and its applications ⋮ Estimate based limited lookahead supervisory control for closed language specifications ⋮ Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control ⋮ Current-state opacity enforcement in discrete event systems under incomparable observations ⋮ Synthesis of maximally permissive supervisors for similarity control of partially observed nondeterministic discrete event systems ⋮ Verification and enforcement of strong infinite- and \(k\)-step opacity using state recognizers ⋮ Dealing with sensor and actuator deception attacks in supervisory control

Cites Work

• Unnamed Item
• Formulas for calculating supremal controllable and normal sublanguages
• On observability of discrete-event systems
• On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation
• Modular supervisory control of discrete-event systems
• On-line control of partially observed discrete event systems
• Supervisory control using variable lookahead policies
• The infimal prefix-closed and observable superlanguage of a given language
• Supervisory Control of a Class of Discrete Event Processes
• Supervisory control of discrete-event processes with partial observations
• Some tractable supervisory control problems for discrete-event systems modeled by Buchi automata
• Think globally, act locally: decentralized supervisory control
• Variable lookahead supervisory control with state information
• Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations
• An algorithm for computing the mask value of the supremal normal sublanguage of a legal language
• Limited lookahead policies in supervisory control of discrete event systems

This page was built for publication: Centralized and distributed algorithms for on-line synthesis of maximal control policies under partial observation