Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Compositional specification and verification of distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Controller synthesis for the “production cell” case study
FMSP '98 Proceedings of the second workshop on Formal methods in software practice
Algebraic Automata Theory
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Revised Lectures from the International Symposium on Compositionality: The Significant Difference
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Formal Development of Reactive Systems - Case Study Production Cell
Supervisor Reduction for Discrete-Event Systems
Discrete Event Dynamic Systems
Undecidable problems of decentralized observation and control on regular languages
Information Processing Letters
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
| Hi-index | 0.00 |
In this article we present an application of decompositions of automata to obtain distributed controllers. The decomposition technique is derived from the classical method of partitions. This is then applied to the domain of discrete event systems. We show that it is possible to decompose a monolithic controller into smaller controllers which are non-conflicting. This is derived from the notion of decompositions via partitions. Some global state information is necessary to ensure that the joint behaviour of the component automata is identical to the original controller. The global state information required is identical to the global information present in Zielonka asynchronous automata. The joint behaviour of the component automata is shown to be non-conflicting.