Verifying Diagnosability of Discrete Event System with Logical Formula

Geng, Xiurui; Ouyang, Dantong; Cheng, Han

doi:10.1049/cje.2020.01.008

Cited by 4 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Close to our research is an approach for testing the diagnosability of DESs based on their logical representation [47]. In [47], conjunctive normal forms (CNFs) are exploited to study the diagnosability properties of DESs.…”

Section: Discussionmentioning

confidence: 99%

Analysis and Control of Partially Observed Discrete-Event Systems via Positively Constructed Formulas

Davydov,

Larionov,

Nagul

2024

Computation

View full text Add to dashboard Cite

This paper establishes a connection between control theory for partially observed discrete-event systems (DESs) and automated theorem proving (ATP) in the calculus of positively constructed formulas (PCFs). The language of PCFs is a complete first-order language providing a powerful tool for qualitative analysis of dynamical systems. Based on ATP in the PCF calculus, a new technique is suggested for checking observability as a property of formal languages, which is necessary for the existence of supervisory control of DESs. In the case of violation of observability, words causing a conflict can also be extracted with the help of a specially designed PCF. With an example of the problem of path planning by a robot in an unknown environment, we show the application of our approach at one of the levels of a robot control system. The prover Bootfrost developed to facilitate PCF refutation is also presented. The tests show positive results and perspectives for the presented approach.

show abstract

Section: Discussionmentioning

confidence: 99%

Analysis and Control of Partially Observed Discrete-Event Systems via Positively Constructed Formulas

Davydov,

Larionov,

Nagul

2024

Computation

View full text Add to dashboard Cite

show abstract

“…Further work also supposes solving other SCT problems such as partially observed DES study, design of decentralized supervisors in the automata form, and DES diagnostic. Note that an approach for testing the diagnosability of DES based on a logical representation is proposed in [27]. In contrast to the logical formalism proposed in this paper, [27] uses a less expressive means to represent automata underlying DES: the Conjunctive Normal Form (CNF).…”

Section: Discussionmentioning

confidence: 99%

“…Note that an approach for testing the diagnosability of DES based on a logical representation is proposed in [27]. In contrast to the logical formalism proposed in this paper, [27] uses a less expressive means to represent automata underlying DES: the Conjunctive Normal Form (CNF). DES transitions are described as a set of clauses, which is taken as a new model for DES.…”

Section: Discussionmentioning

confidence: 99%

Modular discrete event systems control based on logic inference

Davydov¹,

Larionov²,

Nagul³

2021

3rd International Workshop on Information, Computation, and Control Systems for Distributed Environments 2021

View full text Add to dashboard Cite

The paper illustrates an application of the recently developed method of dealing with controlled automata-based discrete event systems with the help of logical inference. The method based on the calculus of positively constructed formulas is extended on the case of systems built out of sets of modules. Specifications restricting system behavior are also supposed to be modular. Due to the special features of the calculus of positively constructed formulas, it may be applied at the upper level of a robot group control system. The case study of mobile robots pushing a block to a target area is considered.

show abstract

Section: Introductionunclassified

“…Близким к нашему исследованию является подход к тестированию диагностируемости ДСС на основе ее логического представления, предложенного в [40]. В [40] для изучения свойств диагностируемости ДСС используются конъюнктивные нормальные формы (КНФ). Переходы автоматов описываются как множество дизъюнктов, и затем хорошо известный метод резолюций применяется для проверки того, можно ли обнаружить события сбоя среди конечного числа наблюдаемых событий.…”

Section: Introductionunclassified

On the application of the calculus of positively constructed formulas for the study of controlled discrete-event systems

Davydov,

Larionov,

Nagul

2024

Model. anal. inf. sist.

View full text Add to dashboard Cite

The article is devoted to the development of an approach to solving the main problems of the theory of supervisory control of logical discrete-event systems (DES), based on their representation in the form of positively constructed formulas (PCF). We consider logical DESs in automata form, understood as generators of some regular languages. The PCF language is a complete first-order language, the formulas of which have a regular structure of alternating type quantifiers and do not contain a negation operator in the syntax. It was previously proven that any formula of the classical first-order predicate calculus can be represented as a PCF. PCFs have a visual tree representation and a natural question-and-answer procedure for searching for an inference using a single inference rule. It is shown how the PCF calculus, developed in the 1990s to solve some problems of control of dynamic systems, makes it possible to solve basic problems of the theory of supervisory control, such as checking the criteria for the existence of supervisory control, automatically modifying restrictions on the behavior of the controlled system, and implementing a supervisor. Due to some features of the PCF calculus, it is possible to use a non-monotonic inference. It is demonstrated how the presented PCF-based method allows for additional event processing during inference. The Bootfrost software system, or the so-called prover, designed to refute the obtained PCFs is also presented, and the features of its implementation are briefly described. As an illustrative example, we consider the problem of controlling an autonomous mobile robot.

show abstract

Verifying Diagnosability of Discrete Event System with Logical Formula

Cited by 4 publications

References 13 publications

Analysis and Control of Partially Observed Discrete-Event Systems via Positively Constructed Formulas

Analysis and Control of Partially Observed Discrete-Event Systems via Positively Constructed Formulas

Modular discrete event systems control based on logic inference

On the application of the calculus of positively constructed formulas for the study of controlled discrete-event systems

Contact Info

Product

Resources

About