On Checking Observability of Formal Languages in DES Control Problems

On Checking Observability of Formal Languages in DES Control Problems

The paper describes a new approach to checking the observability of formal regular languages. As well known, the observability is a crucial property for existence of the supervisory control for partially observed discrete event systems. Our checking procedure is based on the automatic theorem provin...

Full description

Saved in:
Bibliographic Details
Published in:2022 8th International Conference on Control, Decision and Information Technologies (CoDIT) Vol. 1; pp. 1567 - 1572
Main Authors: Davydov, Artem, Larionov, Aleksandr, Nagul, Nadezhda
Format: Conference Proceeding
Language:English
Published: IEEE 17-05-2022
Subjects:
Complexity theory
Discrete-event systems
Formal languages
Inference algorithms
Knowledge based systems
Supervisory control
Switches
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper describes a new approach to checking the observability of formal regular languages. As well known, the observability is a crucial property for existence of the supervisory control for partially observed discrete event systems. Our checking procedure is based on the automatic theorem proving in the calculus of positively constructed formulas. The presented technique may be successfully used in various control problems including those appearing in robotics.
ISSN:2576-3555
DOI:10.1109/CoDIT55151.2022.9804002