Statecharts: A visual formalism for complex systems
Science of Computer Programming
Modular feedback logic for discrete event systems
SIAM Journal on Control and Optimization
A logical approach to discrete math
A logical approach to discrete math
Utilizing symmetry when model-checking under fairness assumptions: an automata-theoretic approach
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient algorithm for controller synthesis under full observation
Journal of Algorithms
Synthesis of concurrent systems with many similar processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Designing reactive systems: integration of abstraction techniques into a synthesis procedure
Journal of Systems and Software - Special issue on artificial and computational intelligence for decisions, control, and automation in engineering and industrial applications
A Survey of Petri Net Methods for Controlled Discrete EventSystems
Discrete Event Dynamic Systems
Bisimulation, the Supervisory Control Problem and StrongModel Matching for Finite State Machines
Discrete Event Dynamic Systems
Synthesis of Controllers of Processes Modeled as ColoredPetri Nets
Discrete Event Dynamic Systems
Automatic Deductive Verification with Invisible Invariants
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Reducing Model Checking of the Many to the Few
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Introduction to Discrete Event Systems
Introduction to Discrete Event Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Systems-theoretic view of component-based software development
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
| Hi-index | 0.00 |
This paper investigates the control of parameterized discrete event systems when specifications are given in terms of predicates and satisfy a similarity assumption. This study is motivated by a weakness in current synthesis methods that do not scale well to huge systems. For systems consisting of similar processes under total or partial observation, conditions are given to deduce properties of a system of n processes (arbitrary size) from properties of a system of n 0 processes (bounded size), with n驴驴驴n 0. Furthermore, it is shown how to infer a control policy for the former from the latter's, while taking into account interconnections between processes.