Communicating sequential processes
Communicating sequential processes
Introduction to algorithms
Reconciling environment integration and software evolution
ACM Transactions on Software Engineering and Methodology (TOSEM)
On statecharts with overlapping
ACM Transactions on Software Engineering and Methodology (TOSEM)
The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
DAC '97 Proceedings of the 34th annual Design Automation Conference
DAC '98 Proceedings of the 35th annual Design Automation Conference
Control generation for embedded systems based on composition of modal processes
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
ipChinook: an integrated IP-based design framework for distributed embedded systems
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
A Language Framework for Multi-Object Coordination
ECOOP '93 Proceedings of the 7th European Conference on Object-Oriented Programming
A Comparison of Statecharts Variants
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Control composition and synthesis of distributed real-time embedded systems
Control composition and synthesis of distributed real-time embedded systems
| Hi-index | 0.00 |
A main advantage of control composition with modal processes [4] is the enhanced retargetability of the composed behavior over a wide variety of target architectures. Unlike previous component models that hardwire the coordination behavior either explicitly in the components or implicitly in the underlying model of computation, modal processes decouple component functionality and coordination protocols. Retargetability is achieved through the synthesis of distributed mode managers, which abstract away low-level synchronization and control communication details that would otherwise be exposed to the component designer. This paper presents an algorithm for the synthesis and optimization of distributed coordination controllers by computing an optimal projection of the global state space onto each processor. It not only minimizes interprocessor communication traffic for coordination but also reduces controller complexity by minimizing replication.