Abstract
Recent modeling experiments conducted in computational music give evidence that a number of concepts, methods and tools belonging to inverse semigroup theory can be attuned towards the concrete modeling of time-sensitive interactive systems. Further theoretical developments show that some related notions of higher-dimensional strings can be used as a unifying theme across word or tree automata theory. In this invited paper, we will provide a guided tour of this emerging theory both as an abstract theory and with a view to concrete applications.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abrial, J.R.: Modeling in Event-B - System and Software Engineering. Cambridge University Press (2010)
Berthaut, F., Janin, D., Martin, B.: Advanced synchronization of audio or symbolic musical patterns: an algebraic approach. International Journal of Semantic Computing 6(4), 409–427 (2012)
Cansell, D., Méry, D.: Foundations of the B method. Computers and Informatics 22 (2003)
Chalopin, J., Métivier, Y.: An efficient message passing election algorithm based on mazurkiewicz’s algorithm. Fundam. Inform. 80(1-3), 221–246 (2007)
Cornock, C., Gould, V.: Proper two-sided restriction semigroups and partial actions. Journal of Pure and Applied Algebra 216, 935–949 (2012)
Dicky, A., Janin, D.: Modélisation algébrique du diner des philosophes. Modélisation des Systèmes Réactifs (MSR). Journal Européen des Systèmes Automatisés (JESA) 47(1-2-3) (November 2013)
Dicky, A., Janin, D.: Embedding finite and infinite words into overlapping tiles. Technical report, LaBRI, Université de Bordeaux (October 2013)
Dubourg, E., Janin, D.: Algebraic tools for the overlapping tile product. Technical report, LaBRI, Université de Bordeaux (October 2013)
Fountain, J.: Right PP monoids with central idempotents. Semigroup Forum 13, 229–237 (1977)
Fountain, J., Gomes, G., Gould, V.: The free ample monoid. Int. Jour. of Algebra and Computation 19, 527–554 (2009)
Hoare, C.: Communicating Sequential Processing. International Series in Computer Science. Prentice-Hall International (1985)
Hollings, C.D.: From right PP monoids to restriction semigroups: a survey. European Journal of Pure and Applied Mathematics 2(1), 21–57 (2009)
Hollings, C.D.: The Ehresmann-Schein-Nambooripad Theorem and its successors. European Journal of Pure and Applied Mathematics 5(4), 414–450 (2012)
Hudak, P.: A sound and complete axiomatization of polymorphic temporal media. Technical Report RR-1259, Department of Computer Science, Yale University (2008)
Janin, D.: Quasi-recognizable vs MSO definable languages of one-dimensional overlapping tiles. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 516–528. Springer, Heidelberg (2012)
Janin, D.: Algebras, automata and logic for languages of labeled birooted trees. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 312–323. Springer, Heidelberg (2013)
Janin, D.: On languages of one-dimensional overlapping tiles. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol. 7741, pp. 244–256. Springer, Heidelberg (2013)
Janin, D.: Overlapping tile automata. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol. 7913, pp. 431–443. Springer, Heidelberg (2013)
Janin, D.: Walking automata in the free inverse monoid. Technical Report RR-1464-12, LaBRI, Université de Bordeaux (2013)
Janin, D., Berthaut, F., DeSainte-Catherine, M., Orlarey, Y., Salvati, S.: The T-calculus : towards a structured programming of (musical) time and space. In: Workshop on Functional Art, Music, Modeling and Design (FARM). ACM Press (2013)
Janin, D., Berthaut, F., DeSainteCatherine, M.: Multi-scale design of interactive music systems: The libTuiles experiment. In: Sound and Music Computing, SMC (2013)
Kellendonk, J.: The local structure of tilings and their integer group of coinvariants. Comm. Math. Phys. 187, 115–157 (1997)
Kellendonk, J., Lawson, M.V.: Tiling semigroups. Journal of Algebra 224(1), 140–150 (2000)
Lawson, M.V.: Semigroups and ordered categories. I. the reduced case. Journal of Algebra 141(2), 422–462 (1991)
Lawson, M.V.: Inverse Semigroups: The theory of partial symmetries. World Scientific (1998)
Lawson, M.V.: McAlister semigroups. Journal of Algebra 202(1), 276–294 (1998)
Margolis, S.W., Pin, J.E.: Languages and inverse semigroups. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol. 172, pp. 337–346. Springer, Heidelberg (1984)
McAlister, D., Reilly, N.R.: E-unitary covers for inverse semigroups. Pacific Journal of Mathematics 68, 178–206 (1977)
Milner, R.: Communication and concurrency. Prentice-Hall (1989)
Munn, W.D.: Free inverse semigroups. Proceeedings of the London Mathematical Society 29(3), 385–404 (1974)
Nambooripad, K.S.S.: The natural partial order on a regular semigroup. Proc. Edinburgh Math. Soc. 23, 249–260 (1980)
Scheiblich, H.E.: Free inverse semigroups. Semigroup Forum 4, 351–359 (1972)
Silva, P.V.: On free inverse monoid languages. ITA 30(4), 349–378 (1996)
Stephen, J.: Presentations of inverse monoids. Journal of Pure and Applied Algebra 63, 81–112 (1990)
Thomas, W.: Languages, automata, and logic. In: Handbook of Formal Languages, vol. III, ch. 7, pp. 389–455. Springer, Heidelberg (1997)
Thomas, W.: Logic for computer science: The engineering challenge. In: Wilhelm, R. (ed.) Informatics: 10 Years Back, 10 Years Ahead. LNCS, vol. 2000, pp. 257–267. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Janin, D. (2014). Towards a Higher-Dimensional String Theory for the Modeling of Computerized Systems. In: Geffert, V., Preneel, B., Rovan, B., Štuller, J., Tjoa, A.M. (eds) SOFSEM 2014: Theory and Practice of Computer Science. SOFSEM 2014. Lecture Notes in Computer Science, vol 8327. Springer, Cham. https://doi.org/10.1007/978-3-319-04298-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-04298-5_2
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04297-8
Online ISBN: 978-3-319-04298-5
eBook Packages: Computer ScienceComputer Science (R0)