EPTCS Proceedings (Volume 204)
Several new models of computation have emerged in the last few
years, and many developments of traditional computational models have
been proposed with the aim of taking into account the new demands of
computer systems users and the new capabilities of computation
engines. A new computational model, or a new feature in a traditional
one, usually is reflected in a new family of programming languages,
and new paradigms of software development.
The aim of this workshop is to bring together researchers who are
currently developing new computational models or new features for
traditional computational models, in order to foster their
interaction, to provide a forum for presenting new ideas and work in
progress, and to enable newcomers to learn about current activities in
DCM 2015 will be a one-day satellite event
the 12th International Colloquium on Theoretical Aspects of Computing (ICTAC 2015), and will take place at the Pontificia Universidad Javeriana, Cali.
This will be
the 11th event in the series since
2005 - see the DCM
website for details of previous events.
Topics of Interest
Topics of interest include all abstract models of computation and
their applications to the development of programming languages and
systems. This includes (but is not limited to):
- Functional calculi: lambda-calculus, rho-calculus, term and graph
- quantum computation, including implementations and formal methods in
- probabilistic computation and verification in modelling situations;
- chemical, biological and bio-inspired computation, including spatial
models, self-assembly, growth models;
- models of concurrency, including the treatment of mobility,
trust, and security;
- infinitary models of computation;
- information-theoretic ideas in computing.
Submissions and Publication
Submit your paper in PDF format via the conference EasyChair
Submissions should be an abstract of at most 5 pages, written in
English. Simultaneous submission to journals, conferences or other
workshops is not permitted.
Please use the EPTCS macro package and follow the instructions of
EPTCS, following the EPTCS
A submission may contain an appendix, but reading the appendix should
not be necessary to assess its merits.
After the workshop authors are invited to submit a full paper of their
presentation. Accepted contributions will appear in an issue of
Submission Deadline for Extended Abstracts:
17 August 2015 (extended)
13 September 2015
Pre-proceedings version due:
5 October 2015
28 October 2015
Submission Deadline for
EPTCS Proceedings :
7 December 2015
Mauricio Ayala Rincón, Universidade de Brasilia (Brazil).
Confluence is a critical property of computational systems which is related with determinism and non ambiguity and thus with other relevant computational attributes of functional specifications and rewriting system as termination and completion. Several criteria have been explored that guarantee confluence and their formalisations provide further interesting information. This talk will discuss topics related with the formalisation of confluence properties in the prototype verification system PVS.
Gilles Dowek, INRIA (France).
Discrete version of special and general relativistic trajectories
(joint work with Pablo Arrighi)
If we assume information has a bounded density and a bounded velocity,
physical phenomena should have a description in terms of cellular automata.
In this talk, I will describe several attempts to describe the trajectories of bodies
in Newtonian mechanics, special relativity, and general relativity with
cellular automata. Interestingly, the local nature of relativity make it more
amenable to a description in terms of cellular automata than Newtonian mechanics.
Pawel Sobocinski, University of Southampton (UK).
Compositional model checking of concurrent systems, with Petri nets
(joint work with Julian Rathke and Owen Stephens)
Compositionality and process equivalence are both standard concepts of process algebra. Compositionality means that the behaviour of a compound system relies only on the behaviour of its components, i.e. there is no emergent behaviour. Process equivalence means that the explicit statespace of a system takes a back seat to its interaction patterns: the information that an environment can obtain though interaction.
Petri nets are a classical, yet widely used and understood, model of concurrency. Nevertheless, they have often been described as a non-compositional model, and tools tend to deal with monolithic, globally-specified models.
In this talk I will introduce Petri Nets with Boundaries (PNB), which is a compositional, graphical algebra of elementary net systems, an important class of Petri nets. I will show that compositionality and process equivalence are a powerful combination that can be harnessed to improve the performance of checking reachability and coverability in several common examples where Petri nets model realistic concurrent systems.
Workshop web page: http://dcm-workshop.org.uk/2015