论文信息 - The Complexity of Collapsing Reachability Graphs - 字舞流文

The Complexity of Collapsing Reachability Graphs

M. R. Garey | Daniel Barbará | Sudhir Aggarwal | Walter Cunto

[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[2] A. Udaya Shankar,et al. Protocol Verification via Projections , 1984, IEEE Transactions on Software Engineering.

[3] Daniel Barbará,et al. A Software Environment for the Specification and Analysis of Problems of Coordination and Concurrency , 1988, IEEE Trans. Software Eng..