On the application of the calculus of positively constructed formulas for the study of controlled discrete-event systems
From MaRDI portal
Publication:6495487
DOI10.18255/1818-1015-2024-1-54-77MaRDI QIDQ6495487FDOQ6495487
Authors: Artem Vasil'evich Davydov, Aleksandr Aleksandrovich Larionov, N. V. Nagul 
Publication date: 30 April 2024
Published in: Modelirovanie i Analiz Informatsionnykh Sistem (Search for Journal in Brave)
automated theorem provingdiscrete event systemsupervisory controlproverpositively constructed formula
Cites Work
- Supervisory Control of a Class of Discrete Event Processes
- Title not available (Why is that?)
- Formal proof - the four color theorem
- Control of discrete-event systems. Automata and Petri net perspectives
- A Framework for Compositional Synthesis of Modular Nonblocking Supervisors
- Supervisory Control of Discrete Event Systems with CTL* Temporal Logic Specifications
- Control problems in a temporal logic framework
- Automation methods for logical derivation and their application in the control of dynamic and intelligent systems
- Supervisory control of discrete-event systems
- A formal proof of the Kepler conjecture
- Machine synthesis of mathematical theorems
- Introduction to Discrete Event Systems
- Supervisory controller synthesis and implementation for safety PLCs
- Prolog Technology Reinforcement Learning Prover
- Logical-optimization approach to pursuit problems for a group of targets
- Leveraging Horn clause solving for compositional verification of PLC software
- Milestones from the Pure Lisp Theorem Prover to ACL2
- Supervisory Control of Fair Discrete-Event Systems: A Canonical Temporal Logic Foundation
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6495487)
