论文信息 - On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels - 字舞流文

On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels

Igor Potapov | A. N. Kurganskii

[1] A. Gladkiĭ,et al. Theory of formal grammars , 1974 .

[2] Jan K. Pachl,et al. Protocol Description and Analysis Based on a State Transition Model with Channel Expressions , 1987, PSTV.

[3] Deepinder P. Sidhu,et al. Experience with formal methods in protocol development , 1991, CCRV.

[4] Raymond E. Miller,et al. Generalized fair reachability analysis for cyclic protocols , 1996, TNET.

[5] Raymond E. Miller,et al. Generalized fair reachability analysis for cyclic protocols: part 1 , 1994, PSTV.

[6] Eric G. Manning,et al. On the Progress of Communications between Two Finite State Machines , 1984, Inf. Control..

[7] S. Purushothaman Iyer,et al. A Unified Approach to the Deadlock Detection Problem in Networks of Communicating Finite State Machines , 1990, CAV.

[8] Hong Liu,et al. Deadlock detection for cyclic protocols using generalized fair reachability analysis , 1993 .