Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 2012: Automata, Languages, and Programming pp 30–41Cite as

Algebraic Synchronization Trees and Processes

  • Conference paper

  • 1605 Accesses

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

Abstract

We study algebraic synchronization trees, i.e., initial solutions of algebraic recursion schemes over the continuous categorical algebra of synchronization trees. In particular, we investigate the relative expressive power of algebraic recursion schemes over two signatures, which are based on those for Basic CCS and Basic Process Algebra, as a means for defining synchronization trees up to isomorphism as well as modulo bisimilarity and language equivalence. The expressiveness of algebraic recursion schemes is also compared to that of the low levels in the Caucal hierarchy.

A full version of this paper may be found at http://www.ru.is/faculty/ luca/PAPERS/algsynch.pdf . Luca Aceto and Anna Ingólfsdóttir have been partially supported by the project ‘Meta-theory of Algebraic Process Theories’ (nr. 100014021) of the Icelandic Research Fund. Arnaud Carayol has been supported by the project AMIS (ANR 2010 JCJC 0203 01 AMIS). Zoltán Ésik has been partially supported by the project TÁMOP-4.2.1/B-09/1/KONV-2010-0005 ‘Creating the Center of Excellence at the University of Szeged’, supported by the European Union and co-financed by the European Regional Fund, and by the National Foundation of Hungary for Scientific Research, grant no. K 75249. Zoltán Ésik’s work on this paper was also partly supported by grant T10003 from Reykjavik University’s Development Fund and a chair from the LabEx Bézout.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky, S.: A Domain Equation for Bisimulation. Inf. Comput. 92(2), 161–218 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  2. Aho, A.V.: Indexed Grammars — an Extension of Context-Free Grammars. J. ACM 15, 647–671 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  3. Baeten, J.C.M., Basten, T., Reniers, M.A.: Process Algebra: Equational Theories of Communicating Processes. Cambridge University Press (2009)

    Google Scholar 

  4. de Bakker, J.W.: Recursive Procedures. Mathematical Centre Tracts, vol. 24. Mathematisch Centrum, Amsterdam (1971)

    Google Scholar 

  5. Bergstra, J.A., Klop, J.W.: The Algebra of Recursively Defined Processes and the Algebra of Regular Processes. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol. 172, pp. 82–94. Springer, Heidelberg (1984)

    Chapter  Google Scholar 

  6. Bloom, S.L., Ésik, Z., Taubner, D.: Iteration Theories of Synchronization Trees. Inf. Comput. 102(1), 1–55 (1993)

    Article  MATH  Google Scholar 

  7. Bloom, S.L., Ésik, Z.: Iteration Theories. Springer (1993)

    Google Scholar 

  8. Bloom, S.L., Ésik, Z.: The Equational Theory of Regular Words. Inf. Comput. 197, 55–89 (2005)

    Article  MATH  Google Scholar 

  9. Bloom, S.L., Ésik, Z.: A Mezei-Wright Theorem for Categorical Algebras. Theor. Comput. Sci. 411, 341–359 (2010)

    Article  MATH  Google Scholar 

  10. van Breugel, F.: An Introduction to Metric Semantics: Operational and Denotational Models for Programming and Specification Languages. Theor. Comput. Sci. 258, 1–98 (2001)

    Article  MATH  Google Scholar 

  11. Carayol, A., Wöhrle, S.: The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 112–123. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Caucal, D.: On Infinite Terms Having a Decidable Monadic Theory. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 165–176. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Caucal, D.: On Infinite Transition Graphs Having a Decidable Monadic Theory. Theor. Comput. Sci. 290, 79–115 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  14. Christensen, S.: Decidability and Decomposition in Process Algebras. PhD thesis ECS-LFCS-93-278, Department of Computer Science, Univ. of Edinburgh (1983)

    Google Scholar 

  15. Courcelle, B.: A Representation of Trees by Languages I and II. Theor. Comput. Sci. 6, 255–279 (1978); Theor. Comput. Sci. 7, 25–55

    Article  MathSciNet  MATH  Google Scholar 

  16. Courcelle, B.: Fundamental Properties of Infinite Trees. Theor. Comput. Sci. 25, 69–95 (1983)

    Article  MathSciNet  Google Scholar 

  17. Ésik, Z.: Continuous Additive Algebras and Injective Simulations of Synchronization Trees. J. Log. Comput. 12, 271–300 (2002)

    Article  MATH  Google Scholar 

  18. Fischer, M.J.: Grammars with Macro-like Productions. In: 9th Annual Symp. Switching and Automata Theory, pp. 131–142. IEEE Press (1968)

    Google Scholar 

  19. Goguen, J.A., Thatcher, J.W., Wagner, E.G., Wright, J.B.: Initial algebra semantics and continuous algebras. J. ACM 24, 68–95 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  20. Guessarian, I.: Algebraic Semantics. LNCS, vol. 99. Springer, Heidelberg (1981)

    Book  MATH  Google Scholar 

  21. Milius, S., Moss, L.: The Category-Theoretic Solution of Recursive Program Schemes. Theor. Comput. Sci. 366, 3–59 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  22. Milner, R.: An Algebraic Definition of Simulation Between Programs. In: Proceedings 2nd Joint Conference on Artificial Intelligence, pp. 481–489. BCS (1971)

    Google Scholar 

  23. Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)

    Book  Google Scholar 

  24. Milner, R.: Communication and Concurrency. Prentice Hall (1989)

    Google Scholar 

  25. Moller, F.: Infinite Results. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 195–216. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  26. Park, D.M.R.: Concurrency and Automata on Infinite Sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167–183. Springer, Heidelberg (1981)

    Chapter  Google Scholar 

  27. Scott, D.S.: The Lattice of Flow Diagrams. In: Symposium on Semantics of Algorithmic Languages 1971. Lecture Notes in Mathematics, vol. 188, pp. 311–366. Springer (1971)

    Google Scholar 

  28. Thomas, W.: A Short Introduction to Infinite Automata. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 130–144. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  29. Thomas, W.: Constructing Infinite Graphs with a Decidable MSO-Theory. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 113–124. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ICE-TCS, School of Computer Science, Reykjavik University, Iceland

    Luca Aceto & Anna Ingólfsdóttir

  2. LIGM, Université Paris-Est, CNRS, France

    Arnaud Carayol

  3. Institute of Informatics, University of Szeged, Hungary

    Zoltán Ésik

Authors
  1. Luca Aceto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arnaud Carayol
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zoltán Ésik
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Anna Ingólfsdóttir
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Centre for Discrete Mathematics and its Applications, University of Warwick, Warwick, UK

    Artur Czumaj

  2. Max-Planck-Institut für Informatik, Saarbrücken, Germany

    Kurt Mehlhorn

  3. Computer Laboratory,, University of Cambridge, UK

    Andrew Pitts

  4. ETH Zurich, Switzerland

    Roger Wattenhofer

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aceto, L., Carayol, A., Ésik, Z., Ingólfsdóttir, A. (2012). Algebraic Synchronization Trees and Processes. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds) Automata, Languages, and Programming. ICALP 2012. Lecture Notes in Computer Science, vol 7392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31585-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31585-5_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31584-8

  • Online ISBN: 978-3-642-31585-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation