Reading and writing is modelled in CSP using actions containing the symbols ? and !. These reading actions and writing actions are synchronous, and there is a one-to-one relationship between occurrences of pairs of these actions. In the CPA conference 2017, we introduced the extended half-synchronous al- phabetised parallel operator X ⇕ Y , which disconnects the writing to and reading from a channel in time; the reading processes are divided into sets which are set-wise asynchronous, but intra-set-wise synchronous, giving full flexibility to the reads. In this paper, we allow multiple writers to write to the same channel set-wise asynchronously, but intra-set-wise synchronously and we study the impact on our (Extended) Vertex Removing Synchronised Product. The advantages we accomplish are that the extension of X ⇕ Y gives more flexibility by indexing the writing actions and the reading actions, leading to a straightforward majority vote design. Furthermore, the extension of X ⇕ Y preserves the advantages of the X ⇕ Y operator.
Reading and writing is modelled in CSP using actions containing the symbols ? and !. These reading actions and writing actions are synchronous, and there is a one-to-one relationship between occurrences of pairs of these actions. In the CPA conference 2016, we introduced the half-synchronous alphabetised parallel operator X ⇓ Y , which disconnects the writing to and reading from a channel in time. We introduce in this paper an extension of X ⇓ Y , where the definition of X ⇓ Y is relaxed; the reading processes are divided into sets which are set-wise asynchronous, but intra-set-wise synchronous, giving full flexibility to the asynchronous writes and reads. Furthermore, we allow multiple writers to the same channel and we study the impact on a Vertex Removing Synchronised Product. The advantages we accomplish are that the extension of X ⇓ Y gives more flexibility by indexing the reading actions and allowing multiple write actions to the same channel. Furthermore, the extension of X ⇓Y reduces the end-to-end processing time of the processor or coprocessor in a distributed computing system. We show the effects of these advantages in a case study describing a Controlled Emergency Stop for a processor-coprocessor combination.
Introduction: Depression can be a serious problem in young adult students. There is a need to implement and monitor prevention interventions for these students. Emotion-regulating improvisational music therapy (EIMT) was developed to prevent depression. The purpose of this study was to evaluate the feasibility of EIMT for use in practice for young adult students with depressive symptoms in a university context. Method: A process evaluation was conducted embedded in a larger research project. Eleven students, three music therapists and five referrers were interviewed. The music therapists also completed evaluation forms. Data were collected concerning client attendance, treatment integrity, musical components used to synchronise, and experiences with EIMT and referral. Results: Client attendance (90%) and treatment integrity were evaluated to be sufficient (therapist adherence 83%; competence 84%). The music therapists used mostly rhythm to synchronise (38 of 99 times). The students and music therapists reported that EIMT and its elements evoked changes in all emotion regulation components. The students reported that synchronisation elicited meaningful experiences of expressing joy, feeling heard, feeling joy and bodily responses of relaxation. The music therapists found the manual useful for applying EIMT. The student counsellors experienced EIMT as an appropriate way to support students due to its preventive character. Discussion: EIMT appears to be a feasible means of evoking changes in emotion regulation components in young adult students with depressive symptoms in a university context. More studies are needed to create a more nuanced and evidence-based understanding of the feasibility of EIMT, processes of change and treatment integrity.
