Formal semantics for interactive music scores: a framework to design, specify properties and execute interactive scenarios

References

• Allen, James F. 1983. “Maintaining Knowledge about Temporal Intervals.” Communication of ACM 26 (11), 832–843. doi: 10.1145/182.358434
   Web of Science ®Google Scholar
• Allombert, Antoine. 2009. “Aspects temporels d'un système de partitions numèriques interactives pour la composition et l'interprétation.” PhD in Computer science, Université de Bordeaux. 351, cours de la Liberation, Talence.
   Google Scholar
• Allombert, Antoine, Gérard Assayag, M. Desainte-Catherine, and Camilo Rueda. 2006. “Concurrent Constraint Models for Interactive Scores.” In Proc. of SMC ’06, Marseille, France: European Commission.
   Google Scholar
• Allombert, Antoine, Gérard Assayag Assayag, and Myriam Desainte-Catherine. 2008. “Iscore: A System for Writing Interaction .” In Proc. of DIMEA ’08, 360–367. New York: ACM.
   Google Scholar
• Assayag Allombert, Antoine, Myriam Desainte-Catherine, and Gerard Assayag. 2008. “De Boxes à Iscore: vers une écriture de l'interaction.” In Proc. of JIM 2008 . Albi, France: Association Française d'Informatique Musicale.
   Google Scholar
• Allombert, Antoine, Pascal Baltazar, Raphaël Marczak, Myriam Desainte-Catherine, and Laurent Garnier. 2010. “Designing an Interactive Intermedia Sequencer from Users Requirements and Theoretical Background.” In Proc. of ICMC 2010. New York: International Computer Music Association.
   Google Scholar
• Latella Baier, Christel, Joost-Pieter Katoen, and Diego Latella. 1998. “Metric Semantics for True Concurrent Real Time.” In Proc. of ICALP ’98 . Berlin, Germany: Springer.
   Google Scholar
• Bresson, Jean, Carlos Agón, and Gérard Assayag. 2005. “OpenMusic 5: A Cross-Platform Release of the Computer-Assisted Composition Environment.” In 10th Brazilian Symposium on Computer Music . Rio de Janeiro, Brazil: Brazilian Computing Society.
   Google Scholar
• Cormen, Thomas H., Clifford Stein, Ronald L. Rivest, and Charles E. Leiserson. 2001. Introduction to Algorithms. Chap. 5, 2nd ed. New York City: McGraw-Hill Higher Education.
   Google Scholar
• Dechter, Rina, Itay Meiri, and Judea Pearl. 1991. “Temporal Constraint Networks.” Artificial Intelligence 49 (1–3): 61–95. doi: 10.1016/0004-3702(91)90006-6
   Web of Science ®Google Scholar
• Desainte-Catherine, M., and N. Brousse. 2003. “Towards a Specification of Musical Interactive Pieces.” In Proc. of CIM XIX . Firenze, Italy: AIMI – Associazione di Informatica Musicale Italiana.
   Google Scholar
• Gennari, Rosella. 1998. “Temporal Resoning and Constraint Programming – A Survey.” CWI Quaterly 11 (16): 3–163.
   Google Scholar
• Langerak, Rom. 1992. “Bundle Event Structures: A Non-Interleaving Semantics for LOTOS.” In Formal Description Techniques, V, Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols, FORTE 92, Perros-Guirec, France, 13–16 October 1992, Vol. C-10 of IFIP Transactions 331–346. Twente, Holland: North-Holland.
   Google Scholar
• Martello, Silvano, and Paolo Toth. 1990. Knapsack Problems: Algorithms and Computer Implementations. Chap. 1. New York: John Wiley & Sons, Inc.
   Google Scholar
• Muscettola, Nicola, Paul H. Morris, and Ioannis Tsamardinos. 1998. “Reformulating Temporal Plans for Efficient Execution.” In Proc. of Principles of Knowledge Representation and Reasoning, 444–452. Trento, Italy: AAAI Digital Library.
   Google Scholar
• Nielsen, M., C. Palamidessi, and F. Valencia. 2002. “Temporal Concurrent Constraint Programming: Denotation, Logic and Applications.” Nordic Journal of Computing 1 (9): 145–188.
   Google Scholar
• Olarte, Carlos, and Camilo Rueda. 2009. “A Declarative Language for Dynamic Multimedia Interaction Systems.” In Proc. of Mathematics and Computation in Music, Vol. 38. Berlin, Germany: Springer.
   Google Scholar
• Planken, Léon, Mathijs de Weerdt, and Neil Yorke-Smith. 2010. “Incrementally Solving STNs by Enforcing Partial Path Consistency.” In ICALPS, 129–136. Bordeaux, France: Springer LNCS (International).
   Google Scholar
• Puckette, Miller, Theodore Apel, and David Zicarelli. 1998. “ Real-Time Audio Analysis Tools for Pd and MSP.” In Proc. of ICMC ’98. Ann Arbor: International Computer Music Association.
   Google Scholar
• Rueda, C., and F. Valencia. 2004. “On Validity in Modelization of Musical Problems by CCP.” Soft Computing 8 (9): 641–648. doi: 10.1007/s00500-004-0390-7
   Web of Science ®Google Scholar
• Saraswat, Vijay A. 1992. Concurrent Constraint Programming. Cambridge, MA: MIT Press.
   Google Scholar
• Toro, Mauricio, Carlos Agón, Gérard Assayag, and Camilo Rueda. 2009. “Ntccrt: A Concurrent Constraint Framework for Real-Time Interaction .” In Proc. of ICMC ’09. Montreal, Canada: International Computer Music Association.
   Google Scholar
• Toro, Mauricio, and Myriam Desainte-Catherine. 2010. “Concurrent Constraint Conditional Branching Interactive Scores.” In Proc. of SMC ’10. Barcelona, Spain: European Commission.
   Google Scholar
• Valencia, Frank D. 2002. “Temporal Concurrent Constraint Programming.” PhD in Computer Science, University of Aarhus. Aarhus, Denmark.
   Google Scholar
• Valencia, Frank D. 2005. “Decidability of Infinite-State Timed CCP Processes and First-Order LTL.” Theoretical Computer Science – Expressiveness in Concurrency 330 (3): 557–607.
   Google Scholar
• Vickery, Lindsay. 2004. “Interactive Control of Higher Order Musical Structures .” In Proc. of ACMC. Victoria University, New Zealand: ACMA.
   Google Scholar
• Xu, Lin, and Berthe Y. Choueiry. 2003. “A New Efficient Algorithm for Solving the Simple Temporal Problem.” In Proceedings of the 10th International Symposium on Temporal Representation and Reasoning/4th International Conference on Temporal Logic 212–222. Los Alamitos, CA: IEEE Computer Society.
   Google Scholar