Progressive Solutions to a Parallel Automata Equation

In this paper, we consider the problem of deriving a component X of a system knowing the behavior of the whole system C and the other components A. The component X is derived by solving the parallel automata equation \(A \Diamond X \cong C\). We present algorithms for deriving the largest progressive solution to the equation that combined with A does not block any possible action in C and we introduce a new simulation relation between automata in order to characterize all progressive solutions.

[1]  Nina Yevtushenko,et al.  Solving Asynchronous Equations , 1998, FORTE.

[2]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[3]  Tiziano Villa,et al.  Solution of parallel language equations for logic synthesis , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[4]  Philip Lewis,et al.  Factorisation of finite state machines under strong and observational equivalences , 2005, Formal Aspects of Computing.

[5]  Nina Yevtushenko,et al.  Testing in context: framework and test derivation , 1996, Comput. Commun..

[6]  Gregor von Bochmann,et al.  On the Construction of Submodule Specifications and Communication Protocols , 1983, TOPL.

[7]  George W. Hart,et al.  Synthesis of Protocols and Protocol Converters Using the Submodule Construcion Approach , 1993, PSTV.

[8]  P. Ramadge,et al.  On the supremal controllable sublanguage of a given language , 1984, The 23rd IEEE Conference on Decision and Control.

[9]  Stéphane Lafortune,et al.  Bisimulation, the Supervisory Control Problem and Strong Model Matching for Finite State Machines , 1998, Discret. Event Dyn. Syst..

[10]  Ratnesh Kumar,et al.  A Discrete Event Systems Approach for Protocol Conversion , 1997, Discret. Event Dyn. Syst..

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

[12]  P. Ramadge,et al.  On the supermal controllable sublanguage of a given language , 1987 .

[13]  Gregor von Bochmann,et al.  A formal method for synthesizing optimized protocol converters and its application to mobile data networks , 1997, Mob. Networks Appl..

[14]  Khaled El-Fakih,et al.  Fault Propagation by Equation Solving , 2004, FORTE.

[15]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[16]  Submodule construction for systems of I / O automata * , 1999 .

[17]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .