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.
On Congruence Property of Scope Equivalence for Concurrent Programs with Higher-Order Communication
By Masaki Murakami
Representation of scopes of names is important for analysis and
verification of concurrent systems. However, it is difficult to
represent the scopes of channel names precisely with models based on
process algebra. We introduced a model of concurrent systems with
higher-order communication based on graph rewriting in our previous
work. A bipartite directed acyclic graph represents a concurrent
system that consists of a number of processes and messages in that
model. The model can represent the scopes of local names precisely.
We defined an equivalence relation such that two systems are
equivalent not only in their behavior but in extrusion of scopes of
names. This paper shows that the equivalence relation is a
congruence relation wrt tau-prefix, new-name, replication and
composition even if higher-order communication is allowed. And we
also show the equivalence relation is not congruent wrt input-prefix
though it is congruent wrt input prefix in first-order case.
Complete record...
|
