On the application of the calculus of positively constructed formulas for the study of controlled discrete-event systems
From MaRDI portal
Publication:6495487
Cites work
- scientific article; zbMATH DE number 3280051 (Why is no real title available?)
- A Framework for Compositional Synthesis of Modular Nonblocking Supervisors
- A formal proof of the Kepler conjecture
- Automation methods for logical derivation and their application in the control of dynamic and intelligent systems
- Control of discrete-event systems. Automata and Petri net perspectives
- Control problems in a temporal logic framework
- Do what you know: coupling knowledge with action in discrete-event systems
- Formal proof - the four color theorem
- Introduction to Discrete Event Systems
- Leveraging Horn clause solving for compositional verification of PLC software
- Logical-optimization approach to pursuit problems for a group of targets
- Machine synthesis of mathematical theorems
- Milestones from the Pure Lisp Theorem Prover to ACL2
- Prolog Technology Reinforcement Learning Prover
- Supervisory Control of Discrete Event Systems with CTL* Temporal Logic Specifications
- Supervisory Control of Fair Discrete-Event Systems: A Canonical Temporal Logic Foundation
- Supervisory Control of a Class of Discrete Event Processes
- Supervisory control of discrete-event systems
- Supervisory controller synthesis and implementation for safety PLCs
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)
