<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sung-Shik T. Q. Jongmans</style></author><author><style face="normal" font="default" size="100%">Dave Clarke</style></author><author><style face="normal" font="default" size="100%">José Proença</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Procedure for Splitting Processes and its Application to Coordination</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings 11th International Workshop on Foundations of Coordination Languages and Self Adaptation - FOCLASA </style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">September</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/joseproenca/files/1209.1422.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">Newcastle, U.K.</style></pub-location><pages><style face="normal" font="default" size="100%">79–96</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We present a procedure for splitting processes in a process algebra with multi-actions (a subset of the&lt;br /&gt;
specification language mCRL2). This splitting procedure cuts a process into two processes along a&lt;br /&gt;
set of actions A: roughly, one of these processes contains no actions from A, while the other process&lt;br /&gt;
contains only actions from A. We state and prove a theorem asserting that the parallel composition&lt;br /&gt;
of these two processes equals the original process under appropriate synchronization.&lt;br /&gt;
We apply our splitting procedure to the process algebraic semantics of the coordination language&lt;br /&gt;
Reo: using this procedure and its related theorem, we formally establish the soundness of splitting&lt;br /&gt;
Reo connectors along the boundaries of their (a)synchronous regions in implementations of Reo.&lt;br /&gt;
Such splitting can significantly improve the performance of connectors.&lt;/p&gt;
</style></abstract></record></records></xml>