[FOM] CiE Newsletter No.49, July 17, 2011
Olivier Bournez
bournez at lix.polytechnique.fr
Sun Jul 17 17:10:50 EDT 2011
CiE Newsletter No.49, July 17, 2011:
Please send any items you would like included in next letter to
Olivier Bournez bournez at lix.polytechnique.fr. DEADLINE: September 10th 2011.
___________________________________________________________________________
** 2012 - THE ALAN TURING YEAR
For the latest news on the ALAN TURING YEAR, please go to
http://www.mathcomp.leeds.ac.uk/turing2012/
** COMPUTABILITY - The Journal of the Association CiE. Now accepting
submissions.
http://www.computability.de/journal/
___________________________________________________________________________
CONTENTS
1) Gregory Chaitin in Scotland August 2011
2) LI2012: first announcement
3) ADFOCS 2011: Advanced Course on the
Foundations of Computer Science, Saarbruecken (Germany), 29 Aug - 2 Sep 2011
4) ACAC 2011: Call for Contributions and Participation
5) AUTOMATA 2011 : deadline extended to August 5
6) Turing Centenary Research Competition - Call for Proposals
7) Domains X 2011: Call for Participation
8) RP 2011: First Call for Participation
9) International Workshop on Relativistic
Quantum Information - North (fwd)
10) QPL 2011 workshop, Nijmegen
11) COMPUTABILITY - The Journal of the
Association CiE. Now accepting submissions.
___________________________________________________________________________
1) Gregory Chaitin in Scotland August 2011
Scottish Informatics & Computer Science Alliance
Distinguished Visitor Lecture Series
15th-19th August, 2011
Edinburgh/Glasgow
Professor Gregory Chaitin
Honorary Professor
University of Buenos Aires
http://chaitinsicsalecturesedin.eventbrite.com/
SICSA is delighted to welcome Professor Chaitin,
the co-founder of Algorithmic Information Theory,
to Scotland. Prof Chaitin will deliver lectures
at the University of Edinburgh and the University
of Glasgow on topics in Algorithmic Information
Theory and Meta-Biology. The programme is:
Mon 15th Aug, Edinburgh
11.00-12.30 The Halting Probability Omega 1
13.00-14.30 The Halting Probability Omega 2
Tues 16th Aug, Edinburgh
11.00-12.30 The Halting Probability Omega 3
13.00-14.30 The Halting Probability Omega 4
Wed 17th Aug, Glasgow
11.00-12.30 Algorithmic Info Theory Landscapes
13.00-14.30 Meta-Biology Landscapes
Thurs 18th Aug, Edinburgh
11.00-12.30 Turing as Biologist 1
13.00-14.30 Turing as Biologist 2
Fri 19th Aug, Edinburgh
11.00-12.30 Life as Evolving Software 1
13.00-14.30
Life as Evolving Software 2
Each lecture will last around 1 hour and will be
followed by 30 minutes discussion. Attendance at
all lectures is free and lunch will be provided.
Edinburgh Lectures will be held in the
Informatics Forum, 10 Crichton Street, Edinburgh,
EH8 9AB. Please register for each day via:
http://chaitinsicsalecturesedin.eventbrite.com
Glasgow Lectures will be held in Room 422, Alwyn
Williams Building, School of Computing Science,
Lilybank Gardens, Glasgow, G12 8QQ. Please
register via: http://chaitinsicsalecturesglasgow.eventbrite.com
For further information, please contact Ms Thea
de Joode, thea.dejoode at ed.ac.uk +44 131 650 6558.
THE HALTING PROBABILITY OMEGA (4 LECTURES)
The halting probability of a program generated by
coin tossing is a paradoxical real number: In
spite of Omega's simple definition, its numerical
value is maximally uncomputable, maximally
unknowable, and shows that pure mathematics
contains infinite irreducible complexity. Omega
can be interpreted pessimistically, as indicating
there are limits to human knowledge. The
optimistic interpretation, which I prefer, is
that Omega shows that one cannot do mathematics
mechanically and that intuition and creativity
are essential. Indeed, in a sense Omega is the
crystallized, concentrated essence of mathematical creativity.
For more information, see http://www.cs.umaine.edu/~chaitin/midas.html
TURING AS A BIOLOGIST (2 LECTURES)
Few people remember Turing's work on pattern
formation in biology (morphogenesis), but
Turing's famous 1936 paper On Computable Numbers
exerted an immense influence on the birth of
molecular biology indirectly, through the work of
John von Neumann on self-reproducing automata,
which influenced Sydney Brenner who in turn
influenced Francis Crick, the Crick of Watson and
Crick, the discoverers of the molecular structure
of DNA. Furthermore, von Neumann's application of
Turing's ideas to biology is beautifully
supported by recent work on evo-devo
(evolutionary developmental biology). The crucial
idea: DNA is multi-billion year old software, but
we could not recognize it as such before Turing's
1936 paper, which according to von Neumann
creates the idea of computer hardware and software.
For more information, see:
http://www.cs.umaine.edu/~chaitin/Proving_Darwin.html
LIFE AS EVOLVING SOFTWARE (2 LECTURES)
Our goal is to prove mathematically that
Darwinian evolution works by studying what
physicists call a toy model, one that is much
simpler than the real thing, but that hopefully
preserves the essential features. DNA is digital
software, so we study the evolution of randomly
mutating software, a hill-climbing random walk in
software space. This approach is starting to
yield mathematical results, which we shall
outline. In particular, Godel incompleteness is
used to show that evolution is unending.
For more information, see: http://www.cs.umaine.edu/~chaitin/sfi.html
__________________________________________________________________________
2) LI2012: first announcement
FIRST ANNOUNCEMENT
LOGIC AND INTERACTIONS 2012 (LI2012)
WINTER SCHOOL and WORKSHOPS
Monday January 30 - Friday March 2
CIRM[1], Luminy, Marseille, France
http://li2012.univ-mrs.fr/
We are organizing a 5 week session at the CIRM in Luminy: ?Logic and
interactions 2012?. This event will gather researchers in various fields
of ?logic in computer science?, following on the success of the Geocal
meeting in 2006 [2].
The meeting will run five consecutive weeks, from 30 January to 2 March
2012, each dedicated to a particular area of logic and its interactions,
as described below. Each week will include lectures, invited talks and
contributed talks, together with work sessions. Lectures are aimed
primarily at PhD students and non-specialist researchers.
* Complexity (30 January - 2 February)
Algorithmic complexity, implicit complexity, light logics, etc.
* Logic and interaction (5 - 10 February)
Geometry of interaction, ludics, games, linguistics, etc.
* Proofs and programs (12 - 17 February)
Realizability, semantics, program extraction, classical logic,
effects and references, concurrent features, etc.
* Quantitative approaches (19 - 24 February)
Differential linear logic, quantitative semantics, stochastic
systems, quantum computation, algebraic lambda-calculi, etc.
* Algebra and computation (26 February - 2 March)
Algebraic invariants of computation, rewriting, model structures,
type theory and homotopy, ordered structures, etc.
Obviously these themes are not disjoint, so we encourage participants,
especially students, to participate to several consecutive weeks.
Lodging at the CIRM[1] will be available for participants. A number of
fundings, especially for students, will be available as well.
Preregistration will open on the web site[3] after the summer.
[1] http://www.cirm.univ-mrs.fr/
[2] http://iml.univ-mrs.fr/geocal06/
[3] http://li2012.univ-mrs.fr/
___________________________________________________________________________
3) ADFOCS 2011: Advanced Course on the
Foundations of Computer Science, Saarbruecken (Germany), 29 Aug - 2 Sep 2011
*****************************************************************
12th Max-Planck Summer School
Advanced Course on the Foundations of Computer Science
ADFOCS 2011 will be held in the week before ALGO'11:
August 29 - September 2, 2011
Saarbruecken, Germany
http://www.mpi-inf.mpg.de/conference/adfocs
*****************************************************************
DEADLINES
------------
Grant applications: June 30
Early registration: July 15
Late registration: August 15
ABOUT ADFOCS
------------
ADFOCS is an international summer school held
annually at the Max Planck Institute of
Informatics (MPII). It is organized as part of
the activities of the MPII, in particular the
International Max-Planck Research School (IMPRS),
MPII's graduate program. The purpose of this
summer school is to introduce young researchers
to topics which are the focus of current research
in theoretical computer science. We bring
together three leading researchers in the field
and international participants at the graduate level and above.
PROGRAM
-------
Our invited speakers give three 90-minute
lectures with subsequent exercise and discussion
sessions. The topics and lecturers are:
* Designing Approximation Algorithms using Semidefinite Programming
Sanjeev Arora, Princeton University
* Additive Integrality Gaps and Discrepancy Theory
Friedrich Eisenbrand, EPFL
* Algorithmic Mechanism Design: Fundamental Techniques and Future Challenges
Robert Kleinberg, Cornell University
LOCATION and TRAVEL INFORMATION
-----------------------------
ADFOCS will be held at the Max Planck Institute
for Informatics in Saarbruecken, Germany.
Saarbruecken is the capital of one of Germany's
16 federal states, the Saarland. It is
conveniently located in the center of Europe, on
the border of Germany with France, between
Luxembourg, the Saar-Mosel valley, Frankfurt, and
Strasbourg. Being located on several main train
and road routes, Saarbruecken is easily reachable
from Frankfurt, Stuttgart, Paris, or Luxembourg.
Saarbruecken also has its own international airport.
REGISTRATION
------------
The registration fee is EUR 120 for *early
registration before July 15* and EUR 170 after
that date. The fee covers lunches and social
events. It does not include accommodation, but we can help you with your
reservations. Per-night prices, including taxes
and breakfast, typically range from EUR 20 (youth
hostel, double room) to about EUR 60 (hotel,
single room). A limited number of grants for
graduate students or young researchers are
available, for application please send a CV and a
letter of recommendation before *June 30*.
Please note that grants roughly cover your
registration and accommodation fees, but will not
be sufficient to cover your travel costs.
CONTACT
-------
The homepage of ADFOCS, providing forms for
registration and hotel reservation can be found at
http://www.mpi-inf.mpg.de/conference/adfocs
If you have further questions, please do not
hesitate to contact the ADFOCS team by sending an
email to adfocs at mpi-inf.mpg.de
Organizers: Anke van Zuylen and Christine Rizkallah, MPII Saarbruecken
___________________________________________________________________________
4) ACAC 2011: Call for Contributions and Participation
CALL FOR CONTRIBUTIONS AND PARTICIPATION
6th Athens Colloquium on Algorithms and Complexity
ACAC 2011
25-26 August, 2011
NTUA, Athens, Greece
http://www.corelab.ece.ntua.gr/acac2011
SCOPE: ACAC is an annual meeting in Athens aiming to bring together
researchers working in all areas of the theory of algorithms and
computational complexity. It serves as a lively forum for presenting
research results that are in a preliminary stage or have been recently
accepted / presented in some major conference. Contributions may
appear, fully or partially, in informal electronic proceedings
available only to the participants (subject to authors' approval). The
language of the workshop is English.
VENUE: National Technical University of Athens, Greece, Zografou
Campus, ECE New Building and Multimedia room (under the Central
Library Building). For directions on how to reach the conference site
see http://www.ntua.gr/en_ntua/campus.htm.
REGISTRATION: There will be no registration fees. However,
participants should register for administrative purposes no later than
August 1, by filling the registration form at
http://www.corelab.ntua.gr/acac2011/registration2.php .
CONTRIBUTION: Participants interested in giving a presentation should
provide a tentative title and a short abstract no later than July 24,
by sending an e-mail to acac11[AT]corelab[DOT]ntua[DOT]gr. The
organizers will make every possible effort so that all interested
participants present their work (subject to schedule constraints).
ORGANIZING COMMITTEE: Dimitris Fotakis, Elias
Koutsoupias, Evangelos Markakis,
Ioannis Milis, Aris Pagourtzis, Stathis Zachos
(chair), Vassilis Zissimopoulos.
LOCAL ARRANGEMENTS: Andreas Goebel, Thanasis Lianeas, Haris
Angelidakis, Eleni Mpakali, Christina Karousatou, Matoula Petrolia.
CONTACT: For registration and further details please contact the
organizers by email to acac11[AT]corelab[DOT]ntua[DOT]gr.
___________________________________________________________________________
5) AUTOMATA 2011 : deadline extended to August 5
Following numerous requests, the submission
deadline for AUTOMATA 2011 has been extended to 5 August 2011.
Best regards,
The Organizing Committee
---
-------------------------------------------------------------------------------
AUTOMATA 2011.
17th International Workshop on Cellular
Automata and Discrete Complex Systems.
Santiago-Chile, November 21-23, 2011.
Local Organizing Committee.
Eric Goles, Alejandro Maass, Ivan Rapaport.
Web Page.
www.automata2011.dim.uchile.cl
Fellowships.
There are few fellowships, travel support and
living expenses, especially for Chileanand
Latin-American students and postdocs. Qualifying
individuals need to fill out the Online
Registration Form and send their curriculum vitae
to the secretary of the workshop before September 30, 2011.
Secretary email.
automata2011 at dim.uchile.cl
Location.
The workshop will be held at the Center for Mathematical Modeling,
Universidad de Chile, UMI-CNRS, Santiago, Chile.
-------------------------------------------------------------------------------
Automata 2011 is the seventeenth workshop in a series of homonimous events
established in 1995. This workshop aims:
To establish and maintain a permanent,
international, multidisciplinary forum for the
collaboration of researchers in the fields of
Cellular Automata (CA) and Discrete Complex Systems (DCS).
To provide a platform for presenting and discussing new ideas and results.
To support the development of theory and
applications of CA and DCS (e.g. parallel
computing, physics, biology, and others) as long
as fundamental aspects and their relations are concerned.
To identify and study within an inter- and
multidisciplinary context, the important fundamental aspects,
concepts, notions and problems concerning CA and DCS.
-------------------------------------------------------------------------------
INVITED SPEAKERS (confirmed):
- Peter Gacs (Boston University, USA)
- Tom Meyerovitch (University of British Columbia, Canada)
- Nicolas Schabanel (CNRS, Universite Paris VII & ENS Lyon, France)
- Damien Woods (Caltech, USA)
-------------------------------------------------------------------------------
IMPORTANT DATES:
- Submission deadline EXTENDED to August 5, 2011
- Notification to authors. September 15, 2011
- Final version. October 20, 2011
- Workshop. November 21-23, 2011
-------------------------------------------------------------------------------
___________________________________________________________________________
6) Turing Centenary Research Competition - Call for Proposals
THE TURING CENTENARY RESEARCH PROJECT:
MIND, MECHANISM AND MATHEMATICS
Research Fellowship and Scholar Competition
http://www.mathcomp.leeds.ac.uk/turing2012/give-page.php?408
Submission deadline - December 16, 2011
More than any other figure, Turing has left a coherent scientific agenda
related to many of the 'Big Questions' concerning the relationship between
the human mind, mechanism in nature, and the mathematics required to
clarify and answer these questions. The very breadth and fundamental
nature of Turing's impact makes the centenary celebration a hugely
opportune period in which to reassert the role of basic thinking in
relation to deep and intractable problems facing science.
'The Turing Centenary Research Project - Mind, Mechanism and Mathematics',
supported by a major grant from the John Templeton Foundation, arises from
the above-mentioned scientific agenda, and is aimed at researchers still
within ten years of receiving their Ph.D. The participants in the research
project will be the winners of the 'Mind, Mechanism and Mathematics'
competition, designed to provide significant funding support for eight
young researchers. Five of the winners will become JTF 'Turing Research
Fellows' with an award of 75,000 UK pounds each; and awards of 45,000 UK
pounds will be for JTF 'Turing Research Scholars' in the 16 to 25
age-group.
The competition is organised in conjunction with the Turing Centenary
Celebration, to be held June 22-25, 2012, at the Manchester City Hall and
the University of Manchester. The award winners will be duly honoured on
the June 23, 2012 centenary of Turing's birth.
Further details:
__________________________________________________________________________
Honorary Chairs: Rodney Brooks and Sir Roger Penrose
Submission deadline - December 16, 2011
Award Notification - March 31, 2012
Award Ceremony - Turing Centenary Day, June 23, 2012
Commencement of the research project - July 1, 2012
Proposals will be judged relative to four research themes:
Chair of the Judges: S Barry Cooper (Leeds)
The Judges for Research Theme 1 (The Mathematics of Emergence: The
Mysteries of Morphogenesis):
Luca Cardelli (Microsoft Research, Cambridge)
Stuart Kauffman (Vermont/Santa Fe)
Cris Moore (New Mexico/Santa Fe)
The Judges for Research Theme 2 (Possibility of Building a Brain:
Intelligent Machines, Practice and Theory):
Luciano Floridi (Oxford/Hertfordshire)
Barbara Grosz (Harvard)
Aaron Sloman (Birmingham)
The Judges for Research Theme 3 (Nature of Information: Complexity,
Randomness, Hiddenness of Information):
Eric Allender (Rutgers)
Rodney Downey (Wellington)
Manindra Agrawal (Kanpur)
The Judges for Research Theme 4 (How should we compute? New Models of
Logic and Computation):
Samson Abramsky (Oxford)
Gordon Plotkin (Edinburgh)
Robert I. Soare (Chicago)
Proposals should be made via the EasyChair submission page at:
http://www.easychair.org/conferences/?conf=turingresearch2012
For further details, see:
http://www.mathcomp.leeds.ac.uk/turing2012/give-page.php?408
__________________________________________________________________________
ALAN TURING YEAR http://www.turingcentenary.eu
_________________
Prof S Barry Cooper Tel: UK: (0113) 343 5165, Int: +44 113 343 5165
School of Mathematics Fax: UK: (0113) 343 5090, Int: +44 113 3435090
University of Leeds Email: pmt6sbc at leeds.ac.uk, Mobile: 07590602104
Leeds LS2 9JT Home tel: (0113) 278 2586, Int: +44 113 2782586
U.K. WWW: http://www.amsta.leeds.ac.uk/~pmt6sbc
__________________________________________________________________________
___________________________________________________________________________
7) (From Ulrich Berger) Domains X 2011: Call for Participation
Workshop Announcement and Call for Participation
D O M A I N S X
http://www.cs.swan.ac.uk/domains2011/
Swansea University, Wales, UK, 5-7 September 2011
Deadline for abstracts of short talks: 25 July 2011
Deadline for Student Grants: 25 July 2011
Registration Deadline: 29 July 2011
INTRODUCTION
The Workshop on Domains is aimed at computer scientists and
mathematicians alike who share an interest in the mathematical
foundations of computation. The workshop will focus on domains,
their applications and related topics. Previous meetings were
held in Darmstadt (94,99,04), Braunschweig (96), Munich (97),
Siegen (98), Birmingham (02), Novosibirsk (07) and Brighton (08).
Besides its traditional topics Domains X will have the
special themes 'Modelling Computational Effects' and
'Modelling Continuous Data.'
The emphasis at Domains workshops is on the exchange of ideas
between participants similar in style to Dagstuhl seminars.
In particular, talks on subjects presented at other conferences
and workshops are acceptable.
INVITED SPEAKERS
Lars Birkedal University of Copenhagen (Denmark)
Nick Benton Microsoft Research Cambridge (UK)
Margarita Korovina University of Manchester (UK)
Dag Normann University of Oslo (Norway)
John Power University of Bath (UK)
Matija Pretnar University of Ljubljana (Slovenia)
Thomas Streicher University of Darmstadt (Germany)
Jeff Zucker McMaster University (Canada)
CONTRIBUTED TALKS
See http://www.cs.swan.ac.uk/domains2011/
Submission of abstracts for short talks will be considered
until July 25. Please submit a one-page abstract via Easychair
https://www.easychair.org/conferences/?conf=domainsx2011
SCOPE
Domain theory has had applications to programming language
semantics and logics (lambda-calculus, PCF, LCF), recursion theory
(Kleene-Kreisel countable functionals), general topology
(injective spaces, function spaces, locally compact spaces, Stone
duality), topological algebra (compact Hausdorff semilattices) and
analysis (measure, integration, dynamical systems). Moreover,
these applications are related - for example, Stone duality gives
rise to a logic of observable properties of computational
processes.
As such, domain theory is highly interdisciplinary. Topics of
interaction with domain theory for this workshop include, but are
not limited to:
program semantics
program logics
probabilistic computation
exact computation over the real numbers
lambda calculus
games
models of sequential computation
constructive mathematics
recursion theory
realizability
real analysis and computability
topology, metric spaces and domains
locale theory
category theory
topos theory
type theory
REGISTRATION
Please register before July 29, 2011.
We offer a standard package including workshop fee,
3 nights en-suite accommodation including breakfast
and lunches for 220 pounds.
Details can be found on the workshop website
http://www.cs.swan.ac.uk/domains2011/
STUDENT GRANTS
A limited number of grants for UK-based research students, funded
by the London Mathematical Society, are available.
Please apply before July 25, 2011.
Details can be found on the workshop website
http://www.cs.swan.ac.uk/domains2011/
VENUE AND ACCOMMODATION
The Domains X workshop will take place at Swansea University,
Department of Computer Science, Robert Recorde Room (2nd floor,
Faraday Building). En-suite accommodation will be on Campus in
House Oxwich. For details see the workshop website
http://www.cs.swan.ac.uk/domains2011/
PROGRAMME COMMITTEE
Ulrich Berger Swansea University (Co-Chair)
Jens Blanck Swansea University
Martin Escardo University of Birmingham (Co-Chair)
Achim Jung University of Birmingham
Klaus Keimel TU Darmstadt
Bernhard Reus University of Sussex
John Tucker Swansea University
ORGANIZING COMMITTEE
Ulrich Berger Swansea University
Jens Blanck Swansea University
Monika Seisenberger Swansea University
PUBLICATION
We plan to publish proceedings of the workshop in a special
volume of a journal. There will be a call for papers after
the workshop. The papers will be refereed according to normal
publication standards.
___________________________________________________________________________
8) RP 2011: First Call for Participation
-----------------------------------------------------------------------------------------
CALL FOR PARTICIPATION: RP 2011
The 5th Edition of the Reachability Problems Workshop
September 28 - September 30, 2011
Genova, Italy
webpage: http://rp11.disi.unige.it/
-----------------------------------------------------------------------------------------
!! REGISTRATION IS OPEN !!
Early registration deadline: July 31, 2011
-----------------------------------------------------------------------------------------
The Reachability Workshop is specifically aimed
at gathering together scholars from diverse
disciplines and backgrounds interested in
reachability problems that appear in Algebraic
structures, Computational models, Hybrid systems, Logic, and Verification.
Topics of interest include: Reachability
problems in infinite state systems, rewriting
systems, dynamical and hybrid systems;
reachability problems in logic and verification;
reachability analysis in different computational
models, counter/ timed/ cellular/ communicating
automata; Petri-Nets; computational aspects of
algebraic structures (semigroups, groups and
rings); frontiers between decidable and
undecidable reachability problems; predictability
in iterative maps and new computational paradigms.
Previous RP editions took place in Brno (Czech
Republic, 2010), Palaiseau (France, 2009),
Liverpool (UK, 2008), Turku (Finland, 2007).
The fifth edition will be held in Genova, a historic city in Liguria, Italy.
INVITED SPEAKERS
Krishnendu Chatterjee, IST Austria
Graph Games with Reachability Objectives: Mixing Chess, Soccer and Poker
Bruno Courcelle, Labri, Universitè Bordeaux 1
Automata for monadic second-order model-checking
Joost-Pieter Katoen, RWTH Aachen
Timed Automata as Observers of Stochastic Processes
Jean-Francois Raskin, CFV, Universitè Libre de Bruxelles
Reachability Problems for Hybrid Automata
ACCEPTED PAPERS
Monotonic Abstraction for Programs with Multiply Pointed Structures
Jonathan Cederberg, Parosh Abdulla and Tomas Vojnar
A new weakly universal cellular automaton in
the 3D hyperbolic space with two states
Maurice Margenstern
Reachability for Finite-State Process Algebras Using Static Analysis
Nataliya Skrypnyuk and Flemming Nielson
A fully symbolic bisimulation algorithm
Malcolm Mumme and Gianfranco Ciardo
Lower bounds for the length of reset words in eulerian automata
Vladimir Gusev
Automated Termination in Model Checking Modulo Theories
Alessandro Carioni, Silvio Ghilardi and Silvio Ranise
Parametric Verification and Test Coverage for
Hybrid Automata Using the Inverse Method
Fribourg Laurent and Ulrich Kuehne
Characterizing Conclusive Approximations by Logical Formulae
Yohan Boichut, Thi-Bich-Hanh Dao and Valerie Murat.
Synthesis of Timing Parameters Satisfying Safety Properties
Etienne Andre' and Romain Soulat
Decidability of LTL Model Checking for Vector
Addition Systems with one zero-test
Remi Bonnet
Completeness of the Bounded Satisfiability Problem for Constraint LTL
Marcello M. Bersani, Achille Frigeri, Matteo Rossi and Pierluigi San Pietro
Reachability and deadlocking problems in multi-stage scheduling
Christian Eggermont and Gerhard J. Woeginger
Improving Reachability Analysis of Infinite State Systems by Specialization
Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti and Valerio Senni
Formal Language Constrained Reachability and
Model Checking Propositional Dynamic Logics
Roland Axelsson and Martin Lange
Complexity Analysis of the Backward Coverability Algorithm for VASS
Laura Bozzelli and Pierre Ganty
Efficient Bounded Reachability Computation for Rectangular Automata
Xin Chen, Erika Abraham and Goran Frehse
The preliminary program is available at the RP webpage
REGISTRATION AND FEES
The early registration deadline is 31st of July.
Early (until July 31)
Regular fee 200 250
Student fee 150 200
Late (after July 31): +50
ACCOMODATION and TRAVEL INFO
September is a very busy period in Genova
(there are several other conferences and events
right before and after RP). We have an option for
a limited number of rooms in the hotels in the
city center. Our University can also offer (a
limited number of) accomodations in Casa Paganini
(student residence) at very convenient prices.
Travel information and on-line
registration/booking forms are available under the RP webpage:
http://rp11.disi.unige.it/
For further information, please contact the RP 2011 organizers:
Giorgio Delzanno: delzanno at disi.unige.it
Igor Potapov: potapov at liverpool.ac.uk
___________________________________________________________________________
9) International Workshop on Relativistic Quantum Information - North (fwd)
Dear Colleague,
We are holding a workshop on Relativistic Quantum Information from Sept 6-8
in Madrid, Spain. This workshop will cover the latest research in RQI,
dealing with topics such as vacuum entanglement and relativistic effects,
cosmological evolution of quantum entanglement/information, continuous
variable techniques in relativistic quantum information , relativistic
multipartite entanglement, and possible experimental tests. Those wishing
to participate can find additional information in the workshop website
http://quinfog.iff.csic.es/rqi2011 .
On behalf of the organizing committee,
Juan Leon
___________________________________________________________________________
10) QPL 2011 workshop, Nijmegen
8th workshop on QUANTUM PHYSICS AND LOGIC (QPL 2011)
Nijmegen, October 27-29, 2011.
http://qpl.science.ru.nl/
Call for submissions.
*
This event will bring together researchers working on mathematical
foundations of quantum physics, quantum computing and information,
and spatio-temporal causal structures, and in particular those that
use logical tools, ordered algebraic and category-theoretic
structures, formal languages, semantical methods and other computer
science methods for the study physical behaviour in general. Over the
past few years, there has been growing activity in these foundational
approaches, together with a renewed interest in the foundations of
quantum theory, which complement the more mainstream research in
quantum computation.
Invited Speakers:
Hans Maassen (Nijmegen)
Urs Schreiber (Utrecht)
Rob Spekkens (Perimeter Institute)
Deadlines:
Submission: Aug 27
Notification of authors: Sep 20
Corrected papers due: Oct 13
Submission:
Prospective speakers are invited to submit a 5-12 page extended
abstract that provides sufficient evidence of results of genuine
interest and provides sufficient detail to allows the program
committee to assess the merits of the work. Submissions of works in
progress are encouraged but must be more substantial than a research
proposal. Submissions should be prepared using LaTeX, and must be
submitted in PDF format at http://www.easychair.org/conferences/?conf=qpl11
Proceedings:
Extended versions of accepted talks will be published in Electronic
Proceedings in Theoretical Computer Science (EPTCS) after the
workshop.
Program committee:
Thorsten Altenkirch (Nottingham)
John Baez (UC Riverside and CQT Singapore)
Dan Browne (UCL - London)
Bob Coecke (Oxford)
Giulio Chiribella (Perimeter Institute)
Andreas Döring (Oxford)
Simon Gay (University of Glasgow)
Bart Jacobs (Nijmegen, co-chair)
Klaas Landsman (Nijmegen)
Prakash Panangaden (McGill)
Simon Perdrix (CNRS - Grenoble)
Mehrnoosh Sadrzadeh (Oxford)
Peter Selinger (Dalhousie, co-chair)
Bas Spitters (Nijmegen)
Local organizers:
Bart Jacobs (Nijmegen)
Bas Spitters (Nijmegen)
Steering committee:
Bob Coecke (Oxford)
Prakash Panangaden (McGill)
Peter Selinger (Dalhousie)
Previous meetings:
Previous QPL workshops were held in Ottawa (2003), Turku (2004),
Chicago (2005), Oxford (2006), Reykjavik (2008), Oxford (2009),
Oxford (2010).
Websites:
http://qpl.science.ru.nl/ (Workshop Homepage)
http://www.easychair.org/conferences/?conf=qpl11 (Submission)
*
Contact:
For more information, please contact Bart Jacobs and Peter Selinger
at qpl11 at easychair.org.
___________________________________________________________________________
11) COMPUTABILITY - The Journal of the
Association CiE. Now accepting submissions.
_______________________________________________________________________
COMPUTABILITY
The Journal of the Association CiE
Now Accepting Submissions!
First volume to be published in 2012
as part of the celebrations of the Alan Turing Year
http://www.computability.de/journal/
_______________________________________________________________________
Aims and Scope
Computability is the journal of the Association Computability in Europe
and it is published by IOS Press in Amsterdam.
The journal Computability is a peer reviewed international journal that
is devoted to publishing original research of highest quality, which is
centered around the topic of computability.
The subject is understood from a multidisciplinary perspective,
recapturing the spirit of Alan Turing (1912-1954) by linking theoretical
and real-world concerns from computer science, mathematics, biology,
physics, computational neuroscience, history and the philosophy of
computing.
Editor-in-Chief
Vasco Brattka (Cape Town, South Africa)
Managing Editors
Paola Bonizzoni (Milan, Italy)
S. Barry Cooper (Leeds, UK)
Benedikt Loewe (Amsterdam, The Netherlands)
Elvira Mayordomo (Zaragoza, Spain)
Editorial Board
Samson Abramsky (Oxford, UK)
Manindra Agrawal (Kanpur, India)
Eric Allender (Piscataway, USA)
Jeremy Avigad (Pittsburgh, USA)
Arnold Beckmann (Swansea, UK)
Olivier Bournez (Palaiseau, France)
Alessandra Carbone (Paris, France)
Karine Chemla (Paris, France)
Bruno Codenotti (Pisa, Italy)
Stephen A. Cook (Toronto, Canada)
Anuj Dawar (Cambridge, UK)
Rodney G. Downey (Wellington, New Zealand)
Natasha Jonoska (Tampa, USA)
Ulrich Kohlenbach (Darmstadt, Germany)
Russell Miller (New York, USA)
Andrei Morozov (Novosibirsk, Russia)
Prakash Panangaden (Montreal, Canada)
Frank Stephan (Singapore)
Vlatko Vedral (Oxford, UK)
Rineke Verbrugge (Groningen, The Netherlands)
Ning Zhong (Cincinnati, USA)
Submission Guidelines
The journal Computability invites submission of full papers of highest
quality on all research topics related to computability.
Computability accepts only submissions of original research papers that
have not been published previously and that are not currently submitted
elsewhere. Full versions of papers that have already been published in
conference proceedings are eligible only if the conference version is
clearly cited and the full version enhances the conference version
significantly.
Authors are requested to submit PDF manuscripts electronically via the
online submission system. Authors can indicate non-binding wishes
regarding Editorial Board Members who should handle their submission.
Final versions of accepted papers have to be prepared using the journal
style file and they need to be submitted together with all source files.
Authors submitting a manuscript do so on the understanding that they
have read and agreed to the terms of the IOS Press Author Copyright
Agreement and that all persons listed as authors have given their
approval for the submission of the paper.
http://www.computability.de/journal/
_________________________________________________________________________
More information about the FOM
mailing list