Advertisement

Minimal separating sets for Muller automata

  • Helmut Lescow
  • Jens Vöge
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1436)

Abstract

For a Muller automaton only a subset of its states is needed to decide whether a run is accepting or not: The set I the infinitely often visited states can be replaced by the intersection IW with a fixed set W of states, provided W is large enough to distinguish between accepting and non-accepting loops in the automaton. We call such a subset W a separating set. Whereas the idea was previously introduced by Mc Naughton [McN93], the algorithmic construction of smallest separating sets is not treated in the literature. In this paper we show that the problem whether in a Muller automaton a separating set of a given size exists is NP-complete. As a step towards an efficient computation of a separating set of minimal size we present an algorithm in the second part of the paper, based on an analysis of the loop structure of the given automaton. An implementation is available.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ATUV97]
    M. Ackermann, W. Thomas, S. Ulbrand, and J. Vöge. Report on the Program omega. to appear, 1997.Google Scholar
  2. [GJ79]
    M. R. Garey and D. S. Johnson. Computers and Intractability, A guide to the theorey of NP-Completeness. Freeman, New York, 1979.Google Scholar
  3. [Kar72]
    R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85–103, New York, 1972. Plenum Press.Google Scholar
  4. [McN66]
    R. McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9:521–530, 1966.Google Scholar
  5. [McN93]
    R. McNaughton. Infinite games played on finite graphs. Ann. Pure Appl Logic, 65:149–184, 1993.Google Scholar
  6. [Mu163]
    D. E. Muller. Infinite sequences on finite machines. In Proc. 4th IEEE Symp. on Switching Circuit Theory and Logical Design, pages 3–16, 1963.Google Scholar
  7. [Tho95]
    Wolfgang Thomas. On the synthesis of strategies in infinite games. In STACS 95, volume 900 of Lect. Notes in Comput. Sci., pages 1–13. Springer-Verlag, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Helmut Lescow
    • 1
  • Jens Vöge
    • 1
  1. 1.Institut für Informatik und Praktische MathematikChristian-Albrechts-Universität KielKiel

Personalised recommendations