Theoretical Computer Science
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
A Discrete Event Systems Approach for Protocol Conversion
Discrete Event Dynamic Systems
Solution of parallel language equations for logic synthesis
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
IEEE Transactions on Software Engineering
Controllers for Discrete Event Systems via Morphisms
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Convertibility verification and converter synthesis: two faces of the same coin
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
ECDAR: an environment for compositional design and analysis of real time systems
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Modal event-clock specifications for timed component-based design
Science of Computer Programming
A Modal Interface Theory for Component-based Design
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
| Hi-index | 0.01 |
We investigate the problem of synthesising an interface automaton R such that P || R≼Q, for given deterministic interface automata P and Q. We show that a solution exists iff P and Q⊥ are compatible, and the most general solution is given by (P ∥ Q⊥)⊥, where P⊥ is the automaton P with inputs and outputs interchanged. We also characterise solutions in terms of winning input strategies in the automaton (P⊗Q⊥)⊥, and the most general solution in terms of the most permissive winning strategy. We apply the synthesis problem for interfaces to the problem of synthesising converters for mismatched protocols.