Skip to main content
SpringerLink
Log in

COMPAS - A Computing Package for Synchronization

  • Conference paper
Book cover Implementation and Application of Automata (CIAA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6482))

Included in the following conference series:

Abstract

In this paper we describe COMPAS - the open-source computing package, dedicated to the computations on synchronizing automata. COMPAS design is based on a generic programming paradigm. This makes the package very powerful because of its flexibility and extensibility. The paper describes shortly the package architecture and its main algorithms and some examples of use. COMPAS allows to easily operate on synchronizing automata, verifying new synchronizing algorithms etc. To the best of our knowledge, this is the first such flexible, extensible and open-source package for synchronization.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Almeida, M., Moreira, N., Reis, R.: Enumeration and generation with a string automata representation. Theor. Comp. Sci. 387(2), 93–102 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ananichev, D.S., Volkov, M.: Synchronizing monotonic automata. Theor. Comp. Sci. 327(3), 225–239 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ananichev, D.S., Volkov, M., Zaks, Y.I.: Synchronizing automata with a letter of deficiency 2. Theor. Comp. Sci. 376(1-2), 30–41 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. boost library, http://www.boost.org

  5. Camparnaud, J.M., Hansel, G.: Automate, a computing package for automata and finite semigroups. J. Symb. Comput. 12, 197–220 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  6. Černý, J.: Poznámka k komogénnym experimentom s konečnými automatmi. Mat. fyz. čas. SAV 14, 208–215 (1964)

    Google Scholar 

  7. Dubuc, L.: Sur les automates circulaires et la conjecture de Černý. RAIRO Inf. Theor. Appl. 32, 21–34 (1998)

    MathSciNet  Google Scholar 

  8. Eppstein, D.: Reset sequences for monotonic automata. SIAM J. Comp. 19, 500–510 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  9. Froidure, V., Pin, J.E.: Algorithms for computing finite semigroups. Foundations of Comp. Math., 112–126 (1997)

    Google Scholar 

  10. Higgins, P.M.: The range order of a product of i transformations from a finite full transformation semigroup. Semigroup Forum 37, 31–36 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kari, J.: A Counter Example to a Conjecture Concerning Synchronizing Words in Finite Automata. Bull. EATCS 73, 146 (2001)

    MathSciNet  MATH  Google Scholar 

  12. Kari, J.: Synchronizing finite automata on Eulerian digraphs. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 432–438. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Kari, J.: Synchronization and Stability of Finite Automata. J. Universal Comp. Sci. 8(2), 270–277

    Google Scholar 

  14. Klyachko, A.A., Rystsov, I.C., Spivak, M.A.: An extremal combinatorial problem associated with the bound of the length of a synchronizing word in an automaton. Cybernetics 23, 165–171 (1987)

    Article  MATH  Google Scholar 

  15. Lombardy, S., Régis-Gianas, Y., Sakarovitch, J.: Introducing VAUCANSON. Theor. Comp. Sci. 328(1-2), 77–96 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  16. Martjugin, P.V.: A series of slowly synchronizing automata with a zero state over a small alphabet. Inform. and Comput. 206(9-10), 1197–1203 (2008)

    Article  MathSciNet  Google Scholar 

  17. Natarajan, B.K.: An algorithmic approach to the automated design of parts orienters. In: 27th Annual Symposium on Foundations of Computer Science, pp. 132–142. IEEE, Los Alamitos (1986)

    Google Scholar 

  18. Pin, J.-E.: Sur un cas pariculier de la conjecture de Černý. In: Ausiello, G., Böhm, C. (eds.) ICALP 1978. LNCS, vol. 62, pp. 345–352. Springer, Heidelberg (1978)

    Chapter  Google Scholar 

  19. Pin, J.-E.: On two combinatorial problems arising from automata theory. Ann. of Discr. Math. 17, 535–548 (1983)

    MathSciNet  MATH  Google Scholar 

  20. Roman, A.: A Note on Černý Conjecture for Automata over 3-Letter Alphabet. J. Aut. Lang. and Comb. 13(2), 141–143 (2008)

    MATH  Google Scholar 

  21. Roman, A.: Synchronizing finite automata with short reset words. Appl. Math. Comp. 209(1), 125–136 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  22. Roman, A.: Genetic Algorithm for Synchronization. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 684–695. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  23. Samotij, W.: A note on the complexity of the problem of finding shortest synchronizing words. In: Proc. AutoMathA 2007, Automata: from Mathematics to Applications, Univ. Palermo, CD (2007)

    Google Scholar 

  24. Skvortsov, E., Zaks, Y.: Synchronizing Random Automata. In: AutoMathA 2009 Conference, to be published in Discr. Math. and Theor. Comp. Sci. (2009)

    Google Scholar 

  25. Trahtman, A.N.: A Package TESTAS for Checking Some Kinds of Testability. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol. 2608, pp. 228–232. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  26. Trahtman, A.N.: An efficient algorithm finds noticeable trends and examples concerning the Černý conjecture. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 789–800. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  27. Volkov, M.: Synchronizing automata and the Road Coloring Theorem. In: A Tutorial on a Satellite Workshop to CSR 2008 ”Workshop on Algebra, Combinatorics and Complexity”, Moscow 2008 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DreamLab Onet.pl sp. z o.o., Gabrieli Zapolskiej 44, 30-126, Kraków, Poland

    Krzysztof Chmiel

  2. Institute of Computer Science, Jagiellonian University, Cracow, Poland

    Adam Roman

Authors
  1. Krzysztof Chmiel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adam Roman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Manitoba, R3T 2N2, Winnipeg, MB, Canada

    Michael Domaratzki

  2. School of Computing, Queen’s University, K7L 3N6, Kingston, Ontario, Canada

    Kai Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chmiel, K., Roman, A. (2011). COMPAS - A Computing Package for Synchronization. In: Domaratzki, M., Salomaa, K. (eds) Implementation and Application of Automata. CIAA 2010. Lecture Notes in Computer Science, vol 6482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18098-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18098-9_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-18097-2

  • Online ISBN: 978-3-642-18098-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation