Abstract
We follow a connection between tight determinisation and complementation and establish a complementation procedure from transition labelled parity automata to transition labelled nondeterministic Büchi automata. We prove it to be tight up to an O(n) factor, where n is the size of the nondeterministic parity automaton. This factor does not depend on the number of priorities.
Extended version with omitted proofs at http://arxiv.org/abs/1406.1090.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. of the Int. Congress on Logic, Methodology, and Philosophy of Science 1960, pp. 1–11 (1962)
Cai, Y., Zhang, T.: A tight lower bound for streett complementation. In: Proc. of FSTTCS 2011. LIPIcs, vol. 13, pp. 339–350 (2011)
Cai, Y., Zhang, T.: Tight upper bounds for streett and parity complementation. In: Proc. of CSL 2011. LIPIcs, vol. 12, pp. 112–128 (2011)
Cai, Y., Zhang, T., Luo, H.: An improved lower bound for the complementation of rabin automata. In: Proc. of LICS 2009 (2009)
Duret-Lutz, A.: Ltl translation improvements in spot. In: Proc. of VECoS 2011, pp. 72–83. British Computer Society (2011)
Friedgut, E., Kupferman, O., Vardi, M.Y.: Büchi complementation made tighter. International Journal of Foundations of Computer Science 17(4), 851–867 (2006)
Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. ACM Transactions on Computational Logic 2(2), 408–429 (2001)
Kurshan, R.P.: Computer-aided verification of coordinating processes: the aut-omata-theoretic approach. Princeton University Press (1994)
Löding, C.: Optimal bounds for transformations of ω-automata. In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol. 1738, pp. 97–121. Springer, Heidelberg (1999)
Michel, M.: Complementation is more difficult with automata on infinite words. Technical report, CNET, Paris (1988) (manuscript)
Pécuchet, J.-P.: On the complementation of Büchi automata. TCS 47(3), 95–98 (1986)
Piterman, N.: From nondeterministic Büchi and Streett automata to deterministic parity automata. Journal of Logical Methods in Computer Science 3(3:5) (2007)
Rabin, M.O., Scott, D.S.: Finite automata and their decision problems. IBM Journal of Research and Development 3, 115–125 (1959)
Safra, S.: On the complexity of ω-automata. In: Proc. of FOCS 1988, pp. 319–327 (1988)
Safra, S.: Exponential determinization for omega-automata with strong-fairness acceptance condition (extended abstract). In: Proc. of STOC 1992, pp. 275–282 (1992)
Sakoda, W.J., Sipser, M.: Non-determinism and the size of two-way automata. In: Proc. of STOC 1978, pp. 274–286. ACM Press (1978)
Schewe, S.: Büchi complementation made tight. In: Proc. of STACS 2009. LIPIcs, vol. 3, pp. 661–672 (2009)
Schewe, S.: Tighter bounds for the determinisation of Büchi automata. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 167–181. Springer, Heidelberg (2009)
Schewe, S., Finkbeiner, B.: Satisfiability and finite model property for the alternating-time μ-calculus. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 591–605. Springer, Heidelberg (2006)
Schewe, S., Finkbeiner, B.: Synthesis of asynchronous systems. In: Puebla, G. (ed.) LOPSTR 2006. LNCS, vol. 4407, pp. 127–142. Springer, Heidelberg (2007)
Schewe, S., Varghese, T.: Tight bounds for the determinisation and complementation of generalised Büchi automata. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, vol. 7561, pp. 42–56. Springer, Heidelberg (2012)
Schewe, S., Varghese, T.: Determinising parity automata. In: Csuhaj-Varjú, E., et al. (eds.) MFCS 2014, Part I. LNCS, vol. 8634, pp. 486–498. Springer, Heidelberg (2014)
Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science 49(3), 217–239 (1987)
Thomas, W.: Complementation of Büchi automata revisited. In: Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pp. 109–122 (1999)
Tsai, M.-H., Tsay, Y.-K., Hwang, Y.-S.: GOAL for games, omega-automata, and logics. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 883–889. Springer, Heidelberg (2013)
Vardi, M.Y.: The Büchi complementation saga. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 12–22. Springer, Heidelberg (2007)
Wilke, T.: Alternating tree automata, parity games, and modal μ-calculus. Bulletin of the Belgian Mathematical Society 8(2) (May 2001)
Yan, Q.: Lower bounds for complementation of ω-automata via the full automata technique. Journal of Logical Methods in Computer Science 4(1:5) (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag GmbH Berlin Heidelberg
About this paper
Cite this paper
Schewe, S., Varghese, T. (2014). Tight Bounds for Complementing Parity Automata. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds) Mathematical Foundations of Computer Science 2014. MFCS 2014. Lecture Notes in Computer Science, vol 8634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44522-8_42
Download citation
DOI: https://doi.org/10.1007/978-3-662-44522-8_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44521-1
Online ISBN: 978-3-662-44522-8
eBook Packages: Computer ScienceComputer Science (R0)