Abstract
We describe a tool that inputs a deterministic \(\omega \)-automaton with any acceptance condition, and synthesizes an equivalent \(\omega \)-automaton with another arbitrary acceptance condition and a given number of states, if such an automaton exists. This tool, that relies on a SAT-based encoding of the problem, can be used to provide minimal \(\omega \)-automata equivalent to given properties, for different acceptance conditions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
References
Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: IJCAI 2009, pp. 399â404, July 2009
Baarir, S., Duret-Lutz, A.: Mechanizing the minimization of deterministic generalized BĂŒchi automata. In: ĂbrahĂĄm, E., Palamidessi, C. (eds.) FORTE 2014. LNCS, vol. 8461, pp. 266â283. Springer, Heidelberg (2014)
Babiak, T., Blahoudek, F., KĆetĂnskĂœ, M., StrejÄek, J.: Effective translation of LTL to deterministic Rabin automata: beyond the (F,G)-fragment. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 24â39. Springer, Heidelberg (2013)
Babiak, T., Blahoudek, F., Duret-Lutz, A., Klein, J., KĆetĂnskĂœ, J., MĂŒller, D., Parker, D., StrejÄek, J.: The Hanoi omega-automata format. In: Kroening, D., PÄsÄreanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 479â486. Springer, Heidelberg (2015)
Chatterjee, K., Gaiser, A., KĆetĂnskĂœ, J.: Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 559â575. Springer, Heidelberg (2013)
Duret-Lutz, A.: Manipulating LTL formulas using spot 1.0. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 442â445. Springer, Heidelberg (2013)
Ehlers, R.: Minimising deterministic BĂŒchi automata precisely using SAT solving. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 326â332. Springer, Heidelberg (2010)
Klein, J., Baier, C.: On-the-fly stuttering in the construction of deterministic \(\omega \)-automata. In: Holub, J., ĆœdâĂĄrek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 51â61. Springer, Heidelberg (2007)
KomĂĄrkovĂĄ, Z., KĆetĂnskĂœ, J.: Rabinizer 3: safraless translation of LTL to small deterministic automata. In: Cassez, F., Raskin, J.-F. (eds.) ATVA 2014. LNCS, vol. 8837, pp. 235â241. Springer, Heidelberg (2014)
KĆetĂnskĂœ, J., Esparza, J.: Deterministic automata for the (F,G)-fragment of LTL. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 7â22. Springer, Heidelberg (2012)
KĆetĂnskĂœ, J., Garza, R.L.: Small deterministic automata for LTL\(_{\setminus \text{ GU }}\). In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 446â450. Springer, Heidelberg (2013)
Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585â591. Springer, Heidelberg (2011)
Minato, S.: Fast generation of irredundant sum-of-products forms from binary decision diagrams. In: SASIMI 1992, pp. 64â73, April 1992
Safra, S.: Complexity of automata on infinite objects. Ph.D. thesis, The Weizmann Institute of Science, Rehovot, Israel, March 1989
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baarir, S., Duret-Lutz, A. (2015). SAT-Based Minimization of Deterministic \(\omega \)-Automata. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2015. Lecture Notes in Computer Science(), vol 9450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48899-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-48899-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48898-0
Online ISBN: 978-3-662-48899-7
eBook Packages: Computer ScienceComputer Science (R0)