Implicit system specification and the interface equation
The Computer Journal - Special issue: formal aspects of computing systems
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Submodule construction as equation solving in CCS
Theoretical Computer Science
On the complexity of equation solving in process algebra
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Factorization of Finite State Machines under Observational Equivalence
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Component-interaction automata as a verification-oriented component-based system specification
SAVCBS '05 Proceedings of the 2005 conference on Specification and verification of component-based systems
Component Substitutability via Equivalencies of Component-Interaction Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Residual for Component Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Component-Interaction Automata Approach (CoIn)
The Common Component Modeling Example
CSSE '08 Proceedings of the 2008 International Conference on Computer Science and Software Engineering - Volume 02
State Space Reduction Techniques for Component Interfaces
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
Synthesis from Component Libraries
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Dynamic component substitutability analysis
FM'05 Proceedings of the 2005 international conference on Formal Methods
| Hi-index | 0.00 |
Component-interaction automata is a verification oriented formalism devised to be general enough to capture important aspects of component interaction in various kinds of component systems. A factorization problem naturally arises in formalisms that are based on composition. In general, the factorization problem may be presented as finding a solution X to the equation M |X ≃S , where | is a composition and ≃ a behavioural equivalence. In our framework, the equivalence is the weak bisimulation and composition is parametrized. We provide a solution for the factorization problem which is built on top of the approach of Qin and Lewis [13].