Annual Conference: Communicating Process Architectures
Communicating Process Architectures 2018,
the 40th. WoTUG conference on concurrent and parallel systems, takes place from
Sunday August 19th. to Wednesday August 22nd. 2018 and is hosted by
Professor Dr. Rainer Spallek,
Chair of
VLSI Design, Diagnostics and Architecture
at the Faculty of Computer Science,
Technische Universität Dresden, Germany.
The conference is organised by Dr. Spallek in collboration with Oliver Knodel and Uwe Mielke
and in partnership with WoTUG.
About WoTUG
WoTUG provides a forum for the discussion and promotion of concurrency ideas,
tools and products in computer science.
It organises specialist workshops and annual conferences that address
key concurrency issues at all levels of software and hardware granularity.
WoTUG aims to progress the leading state of the art in:
-
theory (programming models, process algebra, semantics, ...);
-
practice (multicore processors and run-times, clusters, clouds, libraries, languages, verification, model checking, ...);
-
education (at school, undergraduate and postgraduate levels, ...);
-
applications (complex systems, modelling, supercomputing, embedded systems, robotics, games, e-commerce, ...);
and to stimulate discussion and ideas on the roles concurrency will play in the future:
-
for the next generation of scalable computer infrastructure (hard and soft) and application,
where scaling means the ability to ramp up functionality (stay in control as complexity increases)
as well as physical metrics (such as absolute performance and response times);
-
for system integrity (dependability, security, safety, liveness, ...);
-
for making things simple.
Of course, neither of the above sets of bullets are exclusive.
WoTUG publications
A database of papers and presentations from WoTUG conferences is here.
The Abstract below has been randomly selected from this database.
Successful Termination in Timed CSP
By Paul Howells, Mark d'Inverno
In previous work the authors investigated the inconsistencies of how
successful termination was modelled in Hoare, Brookes and Roscoe's
original CSP. This led to the definition of a variant of CSP, called
CSPt. CSPt presents a solution to these problems by means of adding a
termination axiom to the original process axioms. In this paper we
investigate how successful process termination is modelled in Reed and
Roscoe's Timed CSP, which is the temporal version of Hoare's original
untimed CSP. We discuss the issues that need to be considered when
selecting termination axioms for Timed CSP, based on our experiences
in defining CSPt. The outcome of this investigation and discussion is
a collection of candidate successful termination axioms that could be
added to the existing Timed CSP models, leading to an improved
treatment of successful termination within the Timed CSP framework.
We outline how these termination axioms would be added to the family
of semantic models for Timed CSP. Finally, we outline what further
work needs to be done once these new models for Timed CSP have been
defined. For example, it would then be possible to define timed
versions of the new more flexible parallel operators introduced in
CSPt.
Complete record...
|
