Progressive solutions to a parallel automata equation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2767, Issue , 2003, Pages 367-382

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

^a TOMSK STATE UNIVERSITY   (Russian Federation)

^b AMERICAN UNIVERSITY OF SHARJAH   (United Arab Emirates)

^c UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

SIMULATION RELATION;

AUTOMATA THEORY;

EID: 33646422399     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39979-7_24     Document Type: Article

References (15)

1. Barrett G., Lafortune S.: Bisimulation: The Supervisory Control Problem, and Strong Model Matching for Finite State Machines. Discrete Event Dynamic Systems: Theory and Application. 8(4):377-429 (1998).
2. Bochmann G. v., Merlin, P.: On the Construction of Communication Protocols. ICCC, 1980, 371-378,
3. reprinted in "Communication Protocol Modeling", edited by C. Sunshine, Artech House Publ. (1981).
4. Drissi J., Bochmann G. v.: Submodule Construction for Systems of I/O Automata. ftp://beethoven.site.uottawa.ca/Publications/Dris99b.pdf
5. Hopcroft J. E., Ullman J. D. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979).
6. Kelekar, S.G.H: Synthesis of Protocols and Protocol Converters Using the Submodule Construction Approach. Proc. PSTV, XIII, A. Danthine et al (Eds) (1994).
7. Kumar R., Nelvagal S., Marcus S. I.: A Discrete Event Systems Approach for Protocol Conversion. Discrete Event Dynamical Systems: Theory and Applications. 7(3):295-315 (1997).
8. Merlin P., Bochmann G. v.: On the Construction of Submodule Specifications and Communication Protocols. ACM Trans. On Programming Languages and Systems. 5(1):1-25 (1983).
9. Parrow, J.: Submodule Construction as Equation Solving in CCS. Theoretical Computer Science. Vol. 68 (1989).
10. Petrenko, A., Yevtushenko, N.: Solving Asynchronous Equations. In Proc. of IFIP FORTE/PSTV'98 Conf., Paris, Chapman-Hall (1998).
11. Petrenko, A., Yevtushenko, N., Bochmann, G. v., Dssouli, R.: Testing in Context: Framework and Test Derivation. Computer Communications Journal, Special issue on Protocol engineering. Vol. 19, 1236-1249 (1996).
12. Qin, H., Lewis, P.: Factorisation of Finite State machines Under Strong and Observational Equivalences. Journal of Formal Aspects of Computing, Vol. 3, 284-307 (1991).
13. Tao, Z., Bochmann, G.v., Dssouli, R.: A Formal Method for Synthesizing Optimized Protocol Converters and its Application to Mobile Data Networks. Mobile Networks & Applications. 2(3):259-69 (1997).
14. Wonham W. M., Ramadge P. J.: On the Supremal Controllable Sublanguage of a Given Language. SIAM J. Control. Optim. 25(3):637-659 (1987).
15. Yevtushenko, N., Villa, T., Brayton, R.K., Petrenko, A., Sangiovanni-Vincentelli, A.: Solving a Parallel Language Equation. Proc. of the ICCAD'01, USA, (2001).