Skip to main content
SpringerLink
Log in
Book cover

International Conference on Relational and Algebraic Methods in Computer Science

RAMICS 2015: Relational and Algebraic Methods in Computer Science pp 3–26Cite as

A Quest for Kleene Algebra in 2 Dimensions

  • Conference paper
  • First Online:

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

Abstract

The term Kleene algebra refers to a certain algebraic structure, built up using sequential composition, its iterated version, and union. The key operation is composition: on strings, it connects the final point of the first string to the initial point of the second string.

The quest for Kleene algebra in 2 dimensions starts with the clarification of the notions of word and composition in 2 dimensions. A 2-dimensional word is an arbitrary shape area, consisting of unit square cells, and filled with letters. Word composition puts two words together, without overlapping, and controls the contact elements of the contours of these words. This method actually defines a family of composition operations, indexed by the restrictions used to control the words’ contact parts.

Finite automata and regular expressions are extended to 2 dimensions. The former is relatively easy and it reduces to tiling. For the latter, a few recently introduced classes of regular expressions n2RE and x2RE are presented. The formalism is completed with a mechanism to specify and solve recursive systems o equations for generating languages in 2 dimensions.

Finite automata and regular expressions are equivalent and Kleene algebra provides a beautiful algebraic setting to formalize this result. A section on the limits of our current understanding on lifting this result to 2 dimensions is included.

Finally, we briefly show that, enriched with spatial and temporal data attached to tiles, the formalism leads to a natural model for interactive, distributed programs.

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. Anderson, C., Foster, N., Guha, A., Jeannin, J., Kozen, D., Schlesinger, C., Walker, D.: Netkat: semantic foundations for networks. In: POPL 2014, pp. 113–126 (2014)

    Google Scholar 

  2. Asarin, E., Caspi, P., Maler, O.: Timed regular expressions. Journal of the ACM 49, 172–206 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Banu-Demergian, I.T.: The study of interaction in computing systems. PhD thesis, University of Bucharest (2014)

    Google Scholar 

  4. Banu-Demergian, I.T., Paduraru, C.I., Stefanescu, G.: A new representation of two-dimensional patterns and applications to interactive programming. In: Arbab, F., Sirjani, M. (eds.) FSEN 2013. LNCS, vol. 8161, pp. 183–198. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  5. Banu-Demergian, I.T., Stefanescu, G.: Towards a formal representation of interactive systems. Fundamenata Informaticae 131, 313–336 (2014)

    MathSciNet  MATH  Google Scholar 

  6. Banu-Demergian, I.T., Stefanescu, G.: On the contour representation of two-dimensional patterns. Carpathian Journal Mathematics (2016), Also: Arxiv, CoRR abs/1405.3791 (to appear)

    Google Scholar 

  7. Basu, A., Bensalem, S., Bozga, M., Combaz, J., Jaber, M., Nguyen, T., Sifakis, J.: Rigorous component-based system design using the BIP framework. IEEE Software 28, 41–48 (2011)

    Article  Google Scholar 

  8. Bergstra, J., Ponse, A., Smolka, S. (eds.): Handbook of Process Algebra. Elsevier (2001)

    Google Scholar 

  9. Bloom, S.L., Esik, Z.: Equational axioms for regular sets. Mathematical Structures in Computer Science 3, 1–24 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  10. Bloom, S.L., Esik, Z.: Iteration Theories: The Equational Logic of Iterative Processes. Springer, Berlin (1993)

    Book  MATH  Google Scholar 

  11. Broy, M., Olderog, E.: Trace-oriented models of concurrency. In: [8], pp. 101–196. Elsevier (2001)

    Google Scholar 

  12. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall (1971)

    Google Scholar 

  13. Diaconescu, D., Leustean, I., Petre, L., Sere, K., Stefanescu, G.: Refinement-preserving translation from Event-B to register-voice interactive systems. In: Derrick, J., Gnesi, S., Latella, D., Treharne, H. (eds.) IFM 2012. LNCS, vol. 7321, pp. 221–236. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  14. Diaconescu, D., Petre, L., Sere, K., Stefanescu, G.: Refinement of structured interactive systems. In: Ciobanu, G., Méry, D. (eds.) ICTAC 2014. LNCS, vol. 8687, pp. 133–150. Springer, Heidelberg (2014)

    Google Scholar 

  15. Dragoi, C., Stefanescu, G.: Agapia v0.1: A programming language for interactive systems and its typing system. Electronic Notes in Theoretical Computer Science 203, 69–94 (2008)

    Article  MathSciNet  Google Scholar 

  16. Gadducci, F., Montanari, U.: The tile model. In: Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 133–166. The MIT Press (2000)

    Google Scholar 

  17. Garg, V., Ragunath, M.: Concurrent regular expressions and their relationship to Petri nets. Theoretical Computer Science 96, 285–304 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  18. Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Handbook of Formal Languages, pp. 215–267. Springer (1997)

    Google Scholar 

  19. Giammarresi, D., Restivo, A., Seibert, S., Thomas, W.: Monadic second-order logic over rectangular pictures and recognizability by tiling systems. Information and Computation 125, 32–45 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  20. Gramatovici, R., Petre, L., Sere, K., Stefanescu, A., Stefanescu, G.: Synchronization in timed interactive systems. Technical Report 1047, TUCS (2012)

    Google Scholar 

  21. Grunbaum, B., Shephard, G.: Tilings and Patterns. W.H. Freeman and Co. (1987)

    Google Scholar 

  22. Hoare, T., van Staden, S., Möller, B., Struth, G., Villard, J., Zhu, H., O’Hearn, P.: Developments in Concurrent Kleene Algebra. In: Höfner, P., Jipsen, P., Kahl, W., Müller, M.E. (eds.) RAMiCS 2014. LNCS, vol. 8428, pp. 1–18. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  23. Jeandel, E., Rao, M.: An aperiodic set of 11 Wang tiles. CoRR, abs/1506.06492 (2015)

    Google Scholar 

  24. Joyal, A., Street, R., Verity, D.: Traced monoidal categories. Mathematical Proceedings of the Cambridge Philosophical Society 119, 447–468 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  25. Kleene, S.C.: Representation of events in nerve nets and finite automata. Automata Studies, Princeton University Press, pp. 3–41 (1956)

    Google Scholar 

  26. Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. In: LICS 1991, pp. 214–225. IEEE (1991)

    Google Scholar 

  27. Kozen, D.: Kleene algebra with tests. ACM Trans. Program. Lang. Syst. 19, 427–443 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  28. Krob, D.: Matrix versions of a aperiodic K-rational identities. Theoretical Informatics and Applications 25, 423–444 (1991)

    MathSciNet  MATH  Google Scholar 

  29. Kuich, W., Salomaa, A.: Semirings, automata and languages. Springer, Berlin (1985)

    MATH  Google Scholar 

  30. Latteux, M., Simplot, D.: Context-sensitive string languages and recognizable picture languages. Information and Computation 138, 160–169 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  31. Lindgren, K., Moore, C., Nordahl, M.: Complexity of two-dimensional patterns. Journal of Statistical Physics 91, 909–951 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  32. Miller, J., Page, S.: Complex adaptive systems: an introduction to computational models of social life. Princeton University Press (2009)

    Google Scholar 

  33. Misra, J., Cook, W.: Computation orchestration. Software and System Modelling 6, 83–110 (2007)

    Article  Google Scholar 

  34. Molitor, P.: Free net algebras in vlsi-Theory. Fundamenta Informaticae 11, 117–142 (1988)

    MathSciNet  MATH  Google Scholar 

  35. Paduraru, C.I.: Research on AGAPIA language, compiler and applications. PhD thesis, University of Bucharest (2015)

    Google Scholar 

  36. Patitz, M.: An introduction to tile-based self-assembly and a survey of recent results. Natural Computing 13, 195–224 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  37. Popa, A., Sofronia, A., Stefanescu, G.: High-level structured interactive programs with registers and voices. J. UCS 13, 1722–1754 (2007)

    MathSciNet  Google Scholar 

  38. Reisig, W.: Petri nets: An introduction. Springer Science & Business Media (2012)

    Google Scholar 

  39. Rumbaugh, J., Jacobson, I., Booch, G.: Unified Modeling Language Reference Manual. Pearson Higher Education (2004)

    Google Scholar 

  40. Salomaa, A.: Two complete axiom systems for the algebra of regular events. Journal of the ACM (JACM) 13, 158–169 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  41. Selinger, P.: A survey of graphical languages for monoidal categories. Lecture Notes in Physics, vol. 813, pp. 289–355. Springer (2011)

    Google Scholar 

  42. Sofronia, A., Popa, A., Stefanescu, G.: Undecidability results for finite interactive systems. Romanian Journal of Information Science and Technology 12, 265–279 (2009), Also: Arxiv, CoRR abs/1001.0143

    Google Scholar 

  43. Stefanescu, G.: On flowchart theories: Part II. The nondeterministic case. Theoretical Computer Science 52, 307–340 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  44. Stefanescu, G.: Network algebra. Springer (2000)

    Google Scholar 

  45. Stefanescu, G.: Interactive Systems: From Folklore to Mathematics. In: de Swart, H. (ed.) RelMiCS 2001. LNCS, vol. 2561, pp. 197–211. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  46. Stefanescu, G.: Interactive systems with registers and voices. Draft, National University of Singapore (2004)

    Google Scholar 

  47. Stefanescu, G.: Interactive systems with registers and voices. Fundamenta Informaticae 73, 285–305 (2006)

    MathSciNet  MATH  Google Scholar 

  48. Stefanescu, G.: Self-assembling interactive modules: A research programme. CoRR, abs/1506.05499 (2015)

    Google Scholar 

  49. von Neumann, J., Burks, A: Theory of self-reproducing automata. University of Illinois Press (1966)

    Google Scholar 

  50. Wegner, P.: Interactive foundations of computing. Theoretical Computer Science 192, 315–351 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  51. Wolfram, S.: A new kind of science. Wolfram Media Champaign (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bucharest, Bucharest, Romania

    Gheorghe Stefanescu

Authors
  1. Gheorghe Stefanescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gheorghe Stefanescu .

Editor information

Editors and Affiliations

  1. McMaster University, Hamilton, Ontario, Canada

    Wolfram Kahl

  2. Brock University, St. Catharines, Ontario, Canada

    Michael Winter

  3. Universidade do Minho, Braga, Portugal

    José Oliveira

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Stefanescu, G. (2015). A Quest for Kleene Algebra in 2 Dimensions. In: Kahl, W., Winter, M., Oliveira, J. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2015. Lecture Notes in Computer Science(), vol 9348. Springer, Cham. https://doi.org/10.1007/978-3-319-24704-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24704-5_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24703-8

  • Online ISBN: 978-3-319-24704-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation