Cited in
(35)- Synthesis of covert actuator and sensor attackers
- A framework for compositional nonblocking verification of extended finite-state machines
- On-the-fly informed search of non-blocking directed controllers
- Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming
- What information really matters in supervisor reduction?
- Supervisory controller synthesis and implementation for safety PLCs
- Consistent reduction in discrete-event systems
- Hierarchical modelling of manufacturing systems using discrete event systems and the conflict preorder
- A Framework for Compositional Synthesis of Modular Nonblocking Supervisors
- Supervisory control of discrete event systems with distinguishers
- REGAL
- STCT
- FORCE
- DESUMA
- GIDDES
- UMDES
- TCT
- libFAUDES
- STSLib
- ARGoS
- SCT-based priority-free conditionally-preemptive scheduling of modular real-time systems with exact task execution time
- Compositional coordinator synthesis of extended finite automata
- MTSA
- Optimal modular control of discrete event systems with distinguishers and approximations
- Conflict-preserving abstraction of discrete event systems using annotated automata
- Employing behavioral preorders to define controllability for nondeterministic discrete-event systems
- Modeling for supervisor synthesis -- a lock-bridge combination case study
- Synthesis of least restrictive controllable supervisors for extended finite-state machines with variable abstraction
- Time-optimal control of large-scale systems of systems using compositional optimization
- Compositional synthesis of supervisors in the form of state machines and state maps
- A verification-driven framework for iterative design of controllers
- Diagnosability verification using LTL model checking
- Observation-assisted heuristic synthesis of covert attackers against unknown supervisors
- Networked supervisor synthesis against lossy channels with bounded network delays as non-networked synthesis
- On the computation of counterexamples in compositional nonblocking verification
This page was built for software: Supremica
