Factorization for Component-Interaction Automata

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].

[1]  M. W. Shields.  Implicit System Specification and the Interface Equation , 1989, Comput. J..

[2]  Raffaela Mirandola,et al.  The Common Component Modeling Example: Comparing Software Component Models [result from the Dagstuhl research seminar for CoCoME, August 1-3, 2007] , 2007, CoCoME.

[3]  Christel Baier,et al.  Principles of model checking , 2008 .

[4]  Pavlína Vareková,et al.  Component Substitutability via Equivalencies of Component-Interaction Automata , 2007, FACS.

[5]  Sagar Chaki,et al.  Dynamic Component Substitutability Analysis , 2005, FM.

[6]  Joachim Parrow,et al.  Submodule Construction as Equation Solving in CCS , 1989, Theor. Comput. Sci..

[7]  Kim G. Larsen,et al.  A modal process logic , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[8]  Jean-Baptiste Raclet,et al.  Residual for Component Specifications , 2008, Electron. Notes Theor. Comput. Sci..

[9]  Zhoujun Li,et al.  Timed Component-Interaction Automata for Specification and Verification of Real-Time Reactive Systems , 2008, 2008 International Conference on Computer Science and Software Engineering.

[10]  Lars Grunske,et al.  State Space Reduction Techniques for Component Interfaces , 2008, CBSE.

[11]  Kim G. Larsen,et al.  Equation solving using modal transition systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[12]  Philip Lewis,et al.  Factorization of Finite State Machines under Observational Equivalence , 1990, CONCUR.

[13]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[14]  Ivana Černá,et al.  Component-interaction automata as a verification-oriented component-based system specification , 2006 .

[15]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[16]  Kim G. Larsen,et al.  On the Complexity of Equation Solving in Process Algebra , 1991, TAPSOFT, Vol.1.

[17]  Ian J. Hayes,et al.  FM 2005: Formal Methods, International Symposium of Formal Methods Europe, Newcastle, UK, July 18-22, 2005, Proceedings , 2005, FM.

[18]  Christel Baier,et al.  Principles of Model Checking (Representation and Mind Series) , 2008 .

[19]  Yoad Lustig,et al.  Synthesis from Component Libraries , 2009, FoSSaCS.

[20]  Lubos Brim,et al.  Component-Interaction Automata Approach (CoIn) , 2007, CoCoME.

[21]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.