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

DOI10.18255/1818-1015-2024-1-54-77MaRDI QIDQ6495487

Artem Vasil'evich Davydov, N. V. Nagul, Aleksandr Aleksandrovich Larionov

Publication date: 30 April 2024

Published in: Modelirovanie i Analiz Informatsionnykh Sistem (Search for Journal in Brave)

zbMATH Keywords

discrete event systemsupervisory controlautomated theorem provingproverpositively constructed formula

Mathematics Subject Classification ID

Computer science (68-XX) Systems theory; control (93-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Control of discrete-event systems. Automata and Petri net perspectives
• Automation methods for logical derivation and their application in the control of dynamic and intelligent systems
• Supervisory control of discrete-event systems
• Supervisory controller synthesis and implementation for safety PLCs
• Leveraging Horn clause solving for compositional verification of PLC software
• Milestones from the Pure Lisp Theorem Prover to ACL2
• Logical-optimization approach to pursuit problems for a group of targets
• A Framework for Compositional Synthesis of Modular Nonblocking Supervisors
• Supervisory Control of Discrete Event Systems with CTL* Temporal Logic Specifications
• Machine synthesis of mathematical theorems
• Control problems in a temporal logic framework
• Supervisory Control of a Class of Discrete Event Processes
• Introduction to Discrete Event Systems
• Supervisory Control of Fair Discrete-Event Systems: A Canonical Temporal Logic Foundation
• Prolog Technology Reinforcement Learning Prover
• A FORMAL PROOF OF THE KEPLER CONJECTURE
• Do what you know: coupling knowledge with action in discrete-event systems

This page was built for publication: On the application of the calculus of positively constructed formulas for the study of controlled discrete-event systems