A General Theory of Composition for a Class of "Possibilistic" Properties
IEEE Transactions on Software Engineering
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
On voting machine design for verification and testability
Proceedings of the 16th ACM conference on Computer and communications security
On Adversary Models and Compositional Security
IEEE Security and Privacy
Proceedings of the 2011 ACM Symposium on Research in Applied Computation
| Hi-index | 0.00 |
In this paper, we perform a study of unifying two design concepts of decomposition and composition. The meaning of a unified approach is defined in a sense that, in order to solve a design problem to meet a certain requirement such as security or complexity or performance, an integrated thinking process utilizing both decomposability and composability is employed. This work is done at an architectural and design level. The main idea of our study is rooted from the study of the structural properties of finite state machines. We introduce the notion of (n, m)-design in some detail and illustrate the main idea using an example. Finally, we provide a list of potential applications.