Guest editors' foreword

Luca Aceto, Wan Fokkink, Anna Ingolfsdottir, Zoltán Ésik
<span title="">2005</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
This was a lively scientific event, held in a relaxed workshop atmosphere that allowed for an informal, but intense, discussion of the status of research in the field of process algebra, broadly construed. The workshop witnessed the continuing vitality of this branch of concurrency theory, and we trust that, apart from being a celebration of over 20 years of research in this field, it contributed to its healthy development by highlighting some open problems, and possible new avenues for
more &raquo; ... . We believe that the papers collected in this volume will offer the process algebra community at large some inspiration for reflection on past achievements, and some suggestions for further research. Our efforts in organizing this workshop, and in editing the present volume, will be amply rewarded if young researchers will be enticed to work in process theory by reading the high quality and varied contributions to this volume, by the solution of some of the open problems that were raised during the event, or by the further development of work along the future directions that were pointed out in Bertinoro. The first contribution to this volume is a piece by Jos Baeten of a historical nature. It provides an excellent, personal introduction to the origin of the ideas that form the basis for the field of process algebra, describes the latest developments in this research area, and offers directions for future work. As such, it serves as a scientific preface to the technical contributions in the volume. The scientific contributions to this volume offer a bird's eye view of different research directions in process algebra. The first of these is a study in classic process algebra by Luttik and van Oostrom that provides a generalization of extant results on parallel decomposition of processes modulo bisimulation equivalence. The paper by Corradini and Vogler gives a contribution to the use of process algebra in the quantitative analysis of concurrent systems. It does so by demonstrating how to adapt their previous work on a testing-based faster-than relation to a setting where user behaviour is known to belong to a specific class of request-response behaviours. In particular, the authors show how to determine an asymptotic performance measure for finite-state processes in their approach. Hybrid systems are systems consisting of discrete components interacting with a continuously evolving environment. In light of the increasing deployment of (control) software 0304-3975/$ -see front matter
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1016/j.tcs.2005.01.013</a> <a target="_blank" rel="external noopener" href="">fatcat:e2szysleb5dwtf2saggasd5faq</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> </button> </a>