Modeling temporal constraints for a system of interactive scores
classification
💻 cs.SD
cs.LO
keywords
interactiveconstraintsimplementingmachinescoressolutionanotherbranching
read the original abstract
In this chapter we explain briefly the fundamentals of the interactive scores formalism. Then we develop a solution for implementing the ECO machine by mixing petri nets and constraints propagation. We also present another solution for implementing the ECO machine using concurrent constraint programming. Finally, we present an extension of interactive score with conditional branching.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.