Progressive solutions to a parallel automata equation

Theoretical Computer Science

Volumn 362, Issue 1-3, 2006, Pages 17-32

  El Fakih, Khaled ^a   Yevtushenko, Nina ^b   Buffalov, Sergey ^b   Bochmann, Gregor v ^c  

^a AMERICAN UNIVERSITY OF SHARJAH   (United Arab Emirates)

^b TOMSK STATE UNIVERSITY   (Russian Federation)

^c UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Equation solving; Parallel automata equations; Progressive solutions

Indexed keywords

COMPUTER SCIENCE; PARALLEL ALGORITHMS; PROBLEM SOLVING;

EQUATION SOLVING; PARALLEL AUTOMATA EQUATIONS; PROGRESSIVE SOLUTIONS;

AUTOMATA THEORY;

EID: 33748549949     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.05.034     Document Type: Article

References (17)

1. Barrett G., and Lafortune S. Bisimulation, the supervisory control problem, and strong model matching for finite state machines. Discrete Event Dynamic Systems: Theory Appl. 8 4 (1998) 377-429
2. Bochmann G.v., and Merlin P.M. On the construction of communication protocols, ICCC, 1980, pp. 371-378, reprinted. In: Sunshine C. (Ed). Communication Protocol Modeling (1981), Artech House, Norwood, MA
3. Buffalov S., El-Fakih K., Yevtushenko N., and Bochmann G.v. Progressive solutions for a parallel automata equation. Proc. IFIP 23rd Internat. Conf. on Formal Techniques for Networked and Distributed Systems (FORTE '03), Lecture Notes in Computer Science Vol. 2767 (2003), Springer, Berlin 367-382
4. J. Drissi, G.v. Bochmann, Submodule construction for systems of I/O automata, Technical Report #1133, DIRO, Université de Montréal, Canada, 1999.
5. El-Fakih K., and Yevtushenko N. Fault propagation by equation solving. Proc. IFIP 24th Internat. Conf. on Formal Techniques for Networked and Distributed Systems (FORTE '04), Lecture Notes in Computer Science Vol. 3235 (2004), Springer, Berlin 185-198
6. Hopcroft J.E., and Ullman J.D. Introduction to Automata Theory, Languages, and Computation (1979), Addison-Wesley, Reading, MA
7. Kelekar S.G.H. Synthesis of protocols and protocol converters using the submodule construction approach. In: Danthine A., et al. (Ed). Protocol Specification, Testing, and Verification-PSTV XIII (1994)
8. Kumar R., Nelvagal S., and Marcus S.I. A discrete event systems approach for protocol conversion. Discrete Event Dynamical Systems: Theory Appl. 7 3 (1997) 295-315
9. Merlin P., and Bochman G.v. On the construction of submodule specifications and communication protocols. ACM Trans. Programming Lang. Systems 5 1 (1983) 1-25
10. Parrow J. Submodule construction as equation solving in CCS. Theoret. Comput. Sci. 68 (1989)
11. Petrenko A., and Yevtushenko N. Solving asynchronous equations. In: Bukowski S., Cavalli A., and Najm E. (Eds). Formal Description Techniques and Protocol Specification, Testing, and Verification-FORTE XI/PSTVXVIII '98 (1998), Chapman & Hall, London 231-247
12. Petrenko A., Yevtushenko N., Bochmann G.v., and Dssouli R. Testing in context: framework and test derivation. Comput. Comm. J. Special issue on Protocol Eng. 19 (1996) 1236-1249
13. Qin H., and Lewis P. Factorisation of finite state machines under strong and observational equivalences. J. Formal Aspects Comput. 3 (1991) 284-307
14. Tao Z., Bochmann G.v., and Dssouli R. A formal method for synthesizing optimized protocol converters and its application to mobile data networks. Mobile Networks Appl. 2 3 (1997) 259-269
15. Wonham W.M., and Ramadge P.J. On the supremal controllable sublanguage of a given language. SIAM J. Control Optim. 25 3 (1987) 637-659
16. Yevtushenko N., Villa T., Brayton R.K., Petrenko A., and Sangiovanni-Vincentelli A. Solution of parallel language equations for logic synthesis. Proc. Internat. Conf. on Computer-Aided Design (2001) 103-110
17. N. Yevtushenko, T. Villa, A. Petrenko, R.K. Brayton, A. Sangiovanni-Vincentelli, Logic synthesis by equation solving, Technical Report, Tomsk State University, Russia, 1999, p. 27 (in Russian).