Sudhir Aggarwal, Daniel Barbará, Walter Cunto, M. R. Garey. The Complexity of Collapsing Reachability Graphs. In Joseph Sifakis, editor, Automatic Verification Methods for Finite State Systems, International Workshop, Grenoble, France, June 12-14, 1989, Proceedings. Volume 407 of Lecture Notes in Computer Science, pages 264-274, Springer, 1989.
No references recorded for this publication.
No citations of this publication recorded.