Concurrent Constraint Conditional-Branching Timed Interactive Scores
This work addresses a specific limitation in multimedia scenario modeling for developers, though it appears incremental as it builds on existing formalisms.
The authors tackled the problem of representing conditional branching in timed interactive scores, which existing formalisms could not handle, by proposing a model based on the ntcc calculus and demonstrating acceptable real-time response times in a prototype.
Multimedia scenarios have multimedia content and interactive events associated with computer programs. Interactive Scores (IS) is a formalism to represent such scenarios by temporal objects, temporal relations (TRs) and interactive events. IS describe TRs, but IS cannot represent TRs together with conditional branching. 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) and the response time was acceptable for real-time interaction. An advantage of ntcc over Max/MSP or Petri Nets is that conditions and global constraints are represented declaratively.