1 / 34

CONCURRENT CONSTRAINTS CONDITIONAL-BRANCHING TIMED INTERACTIVE SCORES

CONCURRENT CONSTRAINTS CONDITIONAL-BRANCHING TIMED INTERACTIVE SCORES. LABRI. Mauricio Toro- Bermúdez * a nd Myriam Desainte -Catherine + Université de Bordeaux* + , SCRIME* + , LABRI* + , IPB +. SCRIME annual seminar, July 1st 2010. MOTIVATION.

tambre
Download Presentation

CONCURRENT CONSTRAINTS CONDITIONAL-BRANCHING TIMED INTERACTIVE SCORES

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CONCURRENT CONSTRAINTS CONDITIONAL-BRANCHING TIMED INTERACTIVE SCORES LABRI Mauricio Toro-Bermúdez* and MyriamDesainte-Catherine+ Université de Bordeaux*+, SCRIME*+, LABRI*+, IPB+ • SCRIME annual seminar, July 1st 2010

  2. MOTIVATION • Multimedia scenarios have multimedia content and interactive events associated with computer programs. • Interactive scores is a formalism to represent such scenarios by temporal objects, temporal relations and interactive events.

  3. THE PROBLEM • IS describe temporal relations, but interactive scores cannot represent temporal relations together with conditional branching.

  4. OUR SOLUTION • We propose a model for conditional branching timed IS in the Non-deterministic Timed Concurrent Constraint (ntcc) calculus. • We ran a prototype of our model in Ntccrt (a real-time capable interpreter for ntcc).

  5. DEFINITIONS

  6. EX.: A SCORE WITH A LOOP

  7. EX. USING THE HIERARCHY

  8. CHOICE AND RIGID DURATIONS

  9. NTCCRT

  10. IMPLEMENTATION

  11. IMPLEMENTATION

  12. IMPLEMENTATION

  13. IMPLEMENTATION

  14. IMPLEMENTATION

  15. IMPLEMENTATION

  16. IMPLEMENTATION

  17. IMPLEMENTATION

  18. IMPLEMENTATION

  19. IMPLEMENTATION

  20. IMPLEMENTATION

  21. IMPLEMENTATION

  22. IMPLEMENTATION

  23. IMPLEMENTATION

  24. IMPLEMENTATION

  25. IMPLEMENTATION

  26. RESULTS: REAL-TIME CAPABLE

  27. SOME ALLEN’S RELATIONS

  28. EX. A TEMPORAL SCORE

  29. DENOTATION OF A SCORE • We can express the denotation of an interactive score without loops nor branching in terms of Event Structures. • Using the denotation, we will plan to prove the correctness of the operational models and we will plan to prove properties on the system.

  30. DENOTATION OF THE EXAMPLE

  31. NORMAL FORM

  32. CONCLUSION • An advantage of this model over the previous model of IS, Petri Nets, Max/MSP and PD is representing declaratively conditions and global constraints.

  33. FUTURE WORK • Include sound synthesis based on human gestures. • Explore the limitations of this model compared with a pure temporal model (with no branching).

  34. MERCI • Avez-vous des questions?

More Related