References

1. D. Angluin (1987): Learning Regular Sets from Queries and Counterexamples. Inf. Comput. 75(2), pp. 87–106. Available at http://dx.doi.org/10.1016/0890-5401(87)90052-6.
2. M. C. Chu-Carroll: Algorithm of Kosaraju. http://scienceblogs.com/ goodmath/2007/10/computing_strongly_connected_c.php. Accessed 14 July 2011.
3. S. Chaki & A. Gurfinkel (2011): Automated assume-guarantee reasoning for omega-regular systems and specifications. ISSE 7(2), pp. 131–139. Available at http://dx.doi.org/10.1007/s11334-011-0148-1.
4. Rüdiger Ehlers & Bernd Finkbeiner (2010): On the Virtue of Patience: Minimizing Büchi Automata. In: Jaco van de Pol & Michael Weber: SPIN, Lecture Notes in Computer Science 6349. Springer, pp. 129–145. Available at http://dx.doi.org/10.1007/978-3-642-16164-3_10.
5. Kousha Etessami & Gerard J. Holzmann (2000): Optimizing Büchi Automata. In: Catuscia Palamidessi: CONCUR, Lecture Notes in Computer Science 1877. Springer, pp. 153–167. Available at http://dx.doi.org/10.1007/3-540-44618-4_13.
6. Rüdiger Ehlers (2010): Minimising Deterministic Büchi Automata Precisely Using SAT Solving. In: Ofer Strichman & Stefan Szeider: SAT, Lecture Notes in Computer Science 6175. Springer, pp. 326–332. Available at http://dx.doi.org/10.1007/978-3-642-14186-7_28.
7. N. Eén & N. Sörensson: Minisat. http://minisat.se/. Accessed 13 August 2011.
8. Gregor Gramlich (2007): Über die algorithmische Komplexität regulärer Sprachen. Ph.D. thesis. Available at http://publikationen.ub.uni-frankfurt.de/volltexte/2007/4577/.
9. Gerard Holzmann (2003): SPIN MODEL CHECKER, the: primer and reference manual, first edition. Addison-Wesley Professional.
10. J Hopcroft (1971): An n log n algorithm for minimizing states in a finite automaton. Reproduction, pp. 189–196. Available at http://oai.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=AD0719398.
11. Nils Klarlund & Anders Møller (2001): MONA Version 1.4 User Manual. BRICS, Department of Computer Science, Aarhus University. Notes Series NS-01-1. Available from 101210\p@ plus2\p@ minus5\p@ \z@ plus3\p@ 6\p@ plus3\p@ minus3\p@ \defłeftmarginłeftmargini 2.5\p@ plus1.5\p@ minus\p@ 5\p@ plus2\p@ minus5\p@ıtemsep 2.5\p@ plus1.5\p@ minus\p@łeftmarginłeftmargini 6\p@ plus2\p@ minus2\p@ 3\p@ plus2\p@ minus\p@ıtemsep http://www.brics.dk/mona/. Revision of BRICS NS-98-3.
12. C. Löding (2001): Efficient minimization of deterministic weak omega-automata. Inf. Process. Lett. 79(3), pp. 105–109. Available at http://dx.doi.org/10.1016/S0020-0190(00)00183-6.
13. M. Michel (1988): Complementation is more difficult with automata on infinite words.. CNET, Paris.
14. Nir Piterman (2007): From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata. CoRR abs/0705.2205. Available at http://arxiv.org/abs/0705.2205.
15. Sven Schewe (2010): Minimisation of Deterministic Parity and Buchi Automata and Relative Minimisation of Deterministic Finite Automata. CoRR abs/1007.1333. Available at http://arxiv.org/abs/1007.1333.
16. Ming-Hsien Tsai, Seth Fogarty, Moshe Y. Vardi & Yih-Kuen Tsay (2010): State of Büchi Complementation. In: Michael Domaratzki & Kai Salomaa: CIAA, Lecture Notes in Computer Science 6482. Springer, pp. 261–271. Available at http://dx.doi.org/10.1007/978-3-642-18098-9_28.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org