Advertisement

Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning

  • Monika Rauch Henzinger
  • Jan Arne Telle
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1097)

Abstract

This paper shows how a general technique, called lock-step search, used in dynamic graph algorithms, can be used to improve the running time of two problems arising in program verification and communication protocol design.

  1. (1)

    We consider the nonemptiness problem for Streett automata: We are given a directed graph G = (V, E) with n = ¦V¦ and m = ¦E¦, and a collection of pairs of subsets of vertices, called Streett pairs, 〈L i , U i 〉, i = 1.k. The question is whether G has a cycle (not necessarily simple) which, for each 1 ≤ ik, if it contains a vertex from L i then it also contains a vertex of U i . Let b i=1..k |L i |+|U i |. The previously best algorithm takes time O((m + b) min{n, k}). We present an algorithm that takes time \(O(m\min \{ \sqrt {m log n, } k,n\} + b min\{ log n, k\} )\).

     
  2. (2)

    In communication protocol pruning we are given a directed graph G = (V, E) with l special vertices. The problem is to efficiently maintain the strongly-connected components of the special vertices on a restricted set of edge deletions. Let m i be the number of edges in the strongly connected component of the ith special vertex. The previously best algorithm repeatedly recomputes the strongly-connected components which leads to a running time of O i m i 2 ). We present an algorithm with time \(O(\sqrt l \sum _i m_i^{1.5} )\).

     

Keywords

Model Check Source Component Edge Deletion Special Vertex Current Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    E. A. Emerson and C. L. Lei. Modalities for model checking: Branching time strikes back. Science of Computer Programming, 8 (1987), 275–306.CrossRefGoogle Scholar
  2. 2.
    S. Even and Y. Shiloach, “An On-Line Edge-Deletion Problem”, J. ACM 28 (1981), 1–4.CrossRefGoogle Scholar
  3. 3.
    R. Kurshan. Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, Princeton, 1994.Google Scholar
  4. 4.
    D. Lee, A. N. Netravali, K. K. Sabnani. Protocol Pruning, The Proceedings of IEEE, October 1995.Google Scholar
  5. 5.
    S. Safra. On the complexity of ω-automata. Proc. 29th IEEE Symposium on Foundations of Computer Science (FOCS), 1988, 319–327.Google Scholar
  6. 6.
    R.E. Tarjan. Depth-first search and linear graph algorithms, SIAM Journal on Computing, vol.1, no.2, June 1972, 146–160.CrossRefGoogle Scholar
  7. 7.
    M. Y. Vardi and P. L. Wolper. An Automata-Theoretic Approach to Automatic Program Verification. Proc. 1st IEEE Symposium on Logic in Computer Science (LICS), 1986, 322–331.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Monika Rauch Henzinger
    • 1
  • Jan Arne Telle
    • 2
  1. 1.Systems Research CenterDigital Equipment CorporationPalo Alto
  2. 2.Department of InformaticsUniversity of BergenNorway

Personalised recommendations