Signed real measure of regular languages for discrete event supervisory control

From MaRDI portal
Publication:5704590

DOI10.1080/00207170500202447zbMath1121.93045OpenAlexW2142183123MaRDI QIDQ5704590

No author found.

Publication date: 15 November 2005

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207170500202447




Related Items (18)

Generalized language measure families of probabilistic finite state systemsAn inner product space on irreducible and synchronizable probabilistic finite state automataVector space formulation of probabilistic finite state automataEvaluation of language measure parameters for discrete event manufacturing systems with multiproduct machinesStructural transformations of probabilistic finite state machinesOptimal control of infinite horizon partially observable decision processes modelled as generators of probabilistic regular languagesLanguage-measure-theoretic optimal control of probabilistic finite-state systemsA stopping rule for symbolic dynamic filteringGeneralised projections in finite state automata and decidability of state determinacyAutonomous robot navigation using optimal control of probabilistic regular languagesPath planning in GPS-denied environments via collective intelligence of distributed sensor networksStatistical mechanics of complex systems for pattern identificationGeneralization of Hilbert transform for symbolic analysis of noisy signalsν☆: a robot path planning algorithm based on renormalised measure of probabilistic regular languagesA language measure for partially observed discrete event systemsRenormalized measure of regular languagesAnalytical approach to evaluate language measure parameters for discrete-event supervisory controlDistributed decision propagation in mobile-agent proximity networks


Uses Software


Cites Work




This page was built for publication: Signed real measure of regular languages for discrete event supervisory control