Abstract
Universal Timed Concurrent Constraint Programming (utcc) is a declarative model for concurrency tied to logic. It aims at specifying mobile reactive systems, i.e., systems that continuously interact with the environment and may change their communication structure. In this paper we argue for utcc as a declarative model for dynamic multimedia interaction systems. Firstly, we show that the notion of constraints as partial information allows us to neatly define temporal relations between interactive agents or events. Secondly, we show that mobility in utcc allows for the specification of more flexible and expressive systems. Thirdly, by relying on the underlying temporal logic in utcc, we show how non-trivial temporal properties of the model can be verified. We give two compelling applications of our approach. We propose a model for dynamic interactive scores where interactive points can be defined to adapt the hierarchical structure of the score depending on the information inferred from the environment. We then broaden the interaction mechanisms available for the composer in previous (more static) models. We also model a music improvisation system based on the factor oracle that scales up to situations involving several players, learners and improvisers.
This work has been partially supported by FORCES, an INRIA’s Equipe Associée between the teams COMETE (INRIA), the Music Representation Research Group (IRCAM), and AVISPA.
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
Allauzen, C., Crochemore, M., Raffinot, M.: Factor oracle: A new structure for pattern matching. In: Bartosek, M., Tel, G., Pavelka, J. (eds.) SOFSEM 1999. LNCS, vol. 1725, p. 295. Springer, Heidelberg (1999)
Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26(11) (1983)
Allombert, A., Assayag, G., Desainte-Catherine, M.: A system of interactive scores based on Petri nets. In: Proceedings of SMC 2007 (2007)
Allombert, A., Assayag, G., Desainte-Catherine, M., Rueda, C.: Concurrent constraints models for interactive scores. In: Proceedings of SMC 2006 (2006)
Assayag, G., Dubnov, S., Rueda, C.: A concurrent constraints factor oracle model for music improvisation. In: CLEI 2006 (2006)
Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, Heidelberg (1991)
Milner, R.: Communicating and Mobile Systems: the Pi-Calculus. Cambridge University Press, Cambridge (1999)
Olarte, C., Rueda, C.: A declarative language for dynamic multimedia interaction systems (April 2009), http://www.lix.polytechnique.fr/~colarte/
Olarte, C., Valencia, F.D.: The expressivity of universal timed CCP: Undecidability of monadic FLTL and closure operators for security. In: Proc. of PPDP 2008. ACM, New York (2008)
Olarte, C., Valencia, F.D.: Universal concurrent constraint programing: Symbolic semantics and applications to security. In: Proc. of SAC 2008. ACM Press, New York (2008)
Perez, J.A., Rueda, C.: Non-determinism and probabilities in timed concurrent constraint programming. In: ICLP 2008. LNCS (2008)
Saraswat, V., Jagadeesan, R., Gupta, V.: Foundations of timed concurrent constraint programming. In: Proc. of LICS 1994. IEEE CS, Los Alamitos (1994)
Saraswat, V.A.: Concurrent Constraint Programming. MIT Press, Cambridge (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Olarte, C., Rueda, C. (2009). A Declarative Language for Dynamic Multimedia Interaction Systems. In: Chew, E., Childs, A., Chuan, CH. (eds) Mathematics and Computation in Music. MCM 2009. Communications in Computer and Information Science, vol 38. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02394-1_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-02394-1_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02393-4
Online ISBN: 978-3-642-02394-1
eBook Packages: Computer ScienceComputer Science (R0)