Modeling temporal constraints for a system of interactive scores

TL;DR

This paper explores formal methods for implementing the ECO machine in interactive scores, combining Petri nets, constraints propagation, and concurrent constraint programming, and extends the formalism with conditional branching.

Contribution

It introduces new implementations of the ECO machine using Petri nets and concurrent constraint programming, and extends the formalism with conditional branching.

Findings

Effective implementation of the ECO machine using Petri nets and constraints.

Successful integration of conditional branching into interactive scores.

Enhanced formalism for more flexible interactive score systems.

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.