CiE Newsletter No.22, November 03, 2009 ___________________________________________________________________________ CONTENTS: 1. Final Call for Papers: Greifswald 2010 2. Prix d'encouragement pour les etudiantes en informatique 3. 5th Theory of Quantum Computation, Communication and Cryptography (TQC 2010) 4. ICALP 2010 - Call for Papers 5. Book announcement - Stochastic Coalgebraic Logic 6. Gentzen Centenary Symposium 7. SOFSEM 2010 - Call for Participation 8. Five years of Logical Methods in Computer Science 9. One PhD and one Postdoc Position in Coalgebraic Logics 10. J.UCS Special Issue CCA 2009: First Call for Papers 11. PETRI NETS 2010 - First Call for Papers 12. FP7 ICT Call 6 collaborative research funding =========================================================================== 1. (from Arnold Beckmann) Final Call for Papers: Greifswald 2010: FINAL CALL FOR PAPERS The "Deutsche Vereinigung fuer Mathematische Logik und fuer Grundlagen der Exakten Wissenschaften" (DVMLG), the "Polskie Towarzystwo Logiki i Filozofii Nauki" (PTLiFN), the "Association Computability in Europe" (ACiE) and the "European Association for Computer Science Logic" (EACSL) jointly organize a workshop on Logical Approaches to Barriers in Computing and Complexity http://www.cs.swan.ac.uk/greifswald2010/ Greifswald, 17-20 February 2010 The workshop is sponsored by the Stiftung Alfried Krupp Kolleg Greifswald and the Deutsche Forschungsgemeinschaft (DFG), and takes place at the Alfried Krupp Wissenschaftskolleg in Greifswald, Germany: http://www.wiko-greifswald.de/events/cal/article/6/logical-approaches.html IMPORTANT DATES: Submission of extended abstracts: 7 November 2009 Notification of authors: 15 December 2009 Deadline for final revisions: 5 Januar 2010 Workshop: 17-20 February 2010 FINANCIAL SUPPORT: The local hotel costs of speakers of accepted talks will be covered. In addition to that, we are able to offer partial reimbursement of the travel expenses to speakers of accepted talks. In exeptional cases full reimbursement is possible. DESCRIPTION: Computability theory and complexity theory have their origins in logic. Famous names such as Goedel, Turing, Cook, and Kolmogorov connect these areas of computer science to foundations of mathematics. The fundamental goal of this area is to understand the limits of computability (that is analysing which problems can be solved on nowadays and future computers in principle) and efficient computability (that is understanding the class of problems which can be solved quickly and with restricted resources) where the most famous open problem is the P=NP-problem. Logic provides a multifarious toolbox of techniques to analyse questions like this, some of which promise to provide a deep insight in the structure of limit of computation. In our workshop, we shall focus on the following aspects: logical descriptions of complexity (e.g., descriptive complexity, bounded arithmetic), complexity classes of abstract, algebraic and infinite structures, barriers in proving complexity results, and Kolmogorov complexity and randomness. Some of these aspects are particularly timely: recently, research in these areas became more intense. Part of this is the new conference series CiE (run by the Association for Computability in Europe) whose range of interests includes those of our workshop, creating an important focus on the emerging topics of the field. This workshop is intended as a research-oriented follow-up to the CiE conferences, allowing researchers ample time for discussions and joint work. KEYNOTE SPEAKERS: * Alessandra Carbone (Paris, France) * Lance Fortnow (Evanston, IL, U.S.A.) * Erich Graedel (Aachen, Germany) * Pascal Koiran (Lyon, France) * Leszek Kolodziejczyk (Warsaw, Poland) * Antonina Kolokolova (St.John's, NL, Canada) SPECIAL SESSION: The workshop features a special session on "Complexity in Arbitrary Structures" organised by Christine Gassner (Greifswald, Germany) and Martin Ziegler (Paderborn, Germany). Invited speakers of the special session are * Bruno Poizat (Villeurbanne-cedex, France) (KEYNOTE) * Olivier Bournez (Palaiseau Cedex, France) * Guenter Hotz (Saarbruecken, Germany) * Klaus Meer (Cottbus, Germany) * Monika Seisenberger (Swansea, Wales) * Klaus Weihrauch (Hagen, Germany) * Chee Yap (New York, USA) * Thierry Zell (Hickory, NC, USA) Further details can be found at the special session website http://www.math-inf.uni-greifswald.de/biomathematik/gassner/SpecialSession.h tm Contributed talks will be selected by the Programme Committee from received submissions. The PROGRAM COMMITTEE consists of: * Zofia Adamowicz (Warsaw, Poland) * Franz Baader (Dresden, Germany) * Arnold Beckmann (chair; Swansea, Wales) * Sam Buss (La Jolla CA, U.S.A.) * Manfred Droste (Leipzig, Germany) * Christine Gassner (Greifswald, Germany) * Peter Koepke (Bonn, Germany) * Benedikt Loewe (Amsterdam, The Netherlands) * Johann Makowsky (Haifa, Israel) * Elvira Mayordomo (Zaragoza, Spain) * Damian Niwinski (Warsaw, Poland) * Wolfgang Thomas (Aachen, Germany) * Martin Ziegler (Paderborn, Germany) SUBMISSIONS: The Programme Committee cordially invites all researchers in the area of the workshop to submit their extended abstracts (in PDF-format, at most 4 pages) for presentation at the workshop. Further details about submission can be found on our website http://www.cs.swan.ac.uk/greifswald2010/ Accepted abstracts will be printed in an abstract booklet which will be distributed to the participants of the workshop. We emphatically encourage submissions by female authors, as women are underrepresented in mathematics and computer science. Submission of abstracts of published and presented work is also possible, since the abstract booklet is non-archival. Quality and quantity of submissions permitting, we plan to invite the authors of unpublished papers to submit a full version to a post-proceedings volume after the workshop. =========================================================================== 2. (from Alessandra Carbone) Prix d'encouragement pour les etudiantes en informatique: Chers collègues, J'attire votre attention sur un prix destiné à encourager les femmes à entreprendre une carrière d'excellence en informatique : le « Google Anita Borg Memorial Scholarship ». Celui-ci s'adresse à toute femme étudiant l'informatique dans une université européenne, du Moyen-Orient, ou d'Afrique, au niveau licence, maîtrise ou doctorat. Il est doté d'un prix de 7000 euros. « Multiple scholarships will be awarded based on the strength of candidates academic performance, leadership experience and demonstrated passion for computer science. » La date limite de candidature est le 1er février 2010. Plus d'information ici : http://www.google.com/anitaborg-emea/ =========================================================================== 3. (from Viv Kendon) 5th Theory of Quantum Computation, Communication and Cryptography (TQC 2010): TQC 2010 Announcement ===================== The fifth Conference on the Theory of Quantum Computation, Communication and Cryptography will be held at the University of Leeds, UK, from 13th - 15th April 2010 Conference website: http://tqc2010.leeds.ac.uk/ Quantum computation, quantum communication, and quantum cryptography are subfields of quantum information processing, an interdisciplinary field of information science and quantum mechanics. The TQC conference series focuses on theoretical aspects of these subfields. The objective of the conference is to bring together researchers so that they can interact with each other and share problems and recent discoveries. It will consist of invited talks, contributed talks, and a poster session. *** Invited Speakers: *** * Julia Kempe (Tel-Aviv University) * Kae Nemoto (NII, Tokyo) * Frank Verstraete (University of Vienna) * Ronald de Wolf (CWI, Amsterdam) * Anton Zeilinger (University of Vienna) As has happened for previous TQCs, a post-conference proceedings volume will be published in Springer's Lecture Notes in Computer Science, to which selected speakers will be invited to contribute. The submission deadline is Monday 4th January 2010 * Previous TQCs: * TQC 2009, Institute for Quantum Computing, University of Waterloo, Waterloo, Canada. Post-proceedings: LNCS 5906 (forthcoming) TQC 2008, University of Tokyo, Tokyo, Japan. Post-proceedings: LNCS 5106 TQC 2007, Nara Institute of Science and Technology, Nara, Japan. TQC 2006, NTT R&D Center, Atsugi, Kanagawa, Japan. To receive announcements, calls for papers, and reminders of deadlines, subscribe to the mailing list: http://lists.leeds.ac.uk/mailman/listinfo/tqc2010 ** To contact the organisers, please send email to: tqc2010@leeds.ac.uk ** Conference website: http://tqc2010.leeds.ac.uk/ ** =========================================================================== 4. (from EATCS Secretary) ICALP 2010 - Call for Papers: CALL FOR PAPERS ICALP 2010 37th International Colloquium on Automata, Languages and Programming July 5 12, 2010, Bordeaux, France Supported by the European Association for Theoretical Computer Science (EATCS) http://icalp10.inria.fr/ The 37th International Colloquium on Automata, Languages and Programming, the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS), will take place from the 5th to the 12th of July 2010 in Bordeaux, France. The main conference will be preceded and followed by a series of Workshops. Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are: Track A Algorithms, Complexity and Games Topics: Algorithmic Game Theory - Approximation Algorithms - Combinatorics in Computer Science - Computational Biology - Computational Complexity - Computational Geometry - Cryptography - Data Structures - Design and Analysis of Algorithms - Internet Algorithmics - Machine Learning - Parallel, Distributed and External Memory Computing - Randomness in Computation - Quantum Computing Track B Logic, Semantics, and Theory of Programming Topics: Algebraic and Categorical Models - Automata Theory, Formal Languages - Non-standard Approaches to Computability - Databases, Semi-Structured Data and Finite Model Theory - Principles of Programming Languages - Logics, Formal Methods and Model Checking - Models of Concurrent, Distributed, and Mobile Systems - Models of Reactive, Hybrid and Stochastic Systems - Program Analysis and Transformation - Specification, Refinement and Verification - Type Systems and Theory, Typed Calculi Track C Foundations of Networked Computation: Models, Algorithms and Information Management Topics: Algorithmic Aspects of Networks - Auctions - Computing with Incentives - E-commerce, Privacy, Spam - Formal Methods for Network Information Management - Foundations of Trust and Reputation in Networks - Internet Algorithmics - Mobile and Wireless Networks - Models of Complex Networks · Models and Algorithms for Global Computing - Models of Mobile Computation - Networks Economics - Networks of Low Capability Devices - Overlay Networks and P2P Systems - Social Networks - Specification, Semantics, Synchronization of Networked Systems - Theory of Security in networks and Distributed Computing - Web Searching, Ranking · Web Mining and Analysis Invited Speakers: * Pierre Fraigniaud (CNRS and Univ. Paris Diderot) * Jean Goubault-Larrecq (ENS Cachan and LSV) * Burkhard Monien (Univ. Paderborn) * Joel Ouaknine, (Oxford Univ. Computing Lab.) * Roger Wattenhofer (ETH Zurich) * Emo Welzl (ETH Zurich) Important Dates: * Submission Deadline: Feb 10, 2010 * Author Notification: Apr 6, 2010 * Final Manuscript Due: Apr 27, 2010 Submission Guidelines: Authors are invited to submit an extended abstract of no more than 12 pages in LNCS style presenting original research on the theory of Computer Science. Submissions should indicate to which track (A, B, or C) the paper is submitted. No simultaneous submission to other publication outlets (either a conference or a journal) is allowed. The proceedings will be published in the Lecture Notes in Computer Science Series by Springer-Verlag. It is recommended that submissions adhere to the specified format and length. Submissions that are clearly too long may be rejected immediately. Additional material intended for the referee but not for publication in the final version - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. Conference Chairs: * Cyril Gavoille, Univ. of Bordeaux (LaBRI) & INRIA, Bordeaux. * Claude Kirchner, INRIA, Bordeaux. Program Committees: Track A. Algorithms, Complexity and Games * Dimitris Achlioptas, Univ. Santa Cruz * Kwstis Daskalakis, MIT * Anuj Dawar, Cambridge Univ. * Xiaotie Deng, City Univ. Hong Kong * Philippe Flajolet, INRIA * Micelle Flammini, Univ. L\'Acquilla * Oscar Ibarra, UCSB (Santa Barbara) * Giuseppe Italiano, Univ. Roma 2 * Kazuo Iwama, Univ. Kyoto * Klaus Jansen, Univ. Kiel * Elias Koutsoupias, Univ. Athens * Ludek Kucera, Charles Univ. * Daniel Marx, Budapest Univ. * Burkhard Monien, U Paderborn * Amin Coja Oghlan, Univ. Edinburgh * Tonyann Pitassi, Univ. Toronto * John Reif, Duke Univ. * Jose Rolim, Univ. Geneva * Paul Spirakis, Univ. Patras and RACTI (PC Chair) * Leslie Valiant, Harvard Univ. * Emo Welzl, ETH · Gerhard Woeginger, Univ. Eindhoven Track B Logic, Semantics, and Theory of Programming * Samson Abramsky, Oxford Univ. (PC Chair) * Luca Aceto, Univ. Rejkjavik * Lars Birkedal, Univ. Copenhagen * Mikolaj Bojanczyk, Univ. Warsaw * Patricia Bouyer, CNRS, LSV Cachan * José Desharnais, Univ. Laval e * Gilles Dowek, Ecole Polytechnique & INRIA * Manfred Droste, Univ. Leipzig * Peter Dybjer, Univ. Chalmers * Jose Felix Costa, Univ. Lisbon * Phokion Kolaitis, IBM Almaden * Ugo dal Lago, Univ. Bologna * Daniel Leivant, Univ. Indiana * Andrzej Murawski, Oxford Univ. * Filip Murlak, Univ. Edinburgh * Flemming Nielsen, Univ. Copenhagen * Dominique Perrin, Univ. Paris Est * Alex Rabinovich, Univ. Tel Aviv * Lutz Schroder, Univ. Bremen * Ian Stark, Univ. Edinburgh Track C Foundations of Networked Computation: Models, Algorithms and Information Management * Debora Donato, Yahoo! Research Barcelona * Faith Ellen, Univ. Toronto * Phil Gibbons, Intel Research Pittsburgh * Rob van Glabbeek, Stanford Univ. and National ICT Australia * Monika Henzinger, EPFL Lausanne * Christos Kaklamanis, Univ. of Patras * Fabian Kuhn, MIT * Miroslaw Kutylowski, Univ. Wroclaw * Christian Lengauer, Univ. Passau * Stefano Leonardi, Sapienza Univ. of Rome * Friedhelm Meyer auf der Heide, Univ. Paderborn (PC chair) * Dusko Pavlovic, Oxford Univ. and Kestrel Institute * Andrzej Pelc, Univ. du Quebec en Outaouais * Giuseppe Persiano, Univ. Salerno * Frank Pfenning, CMU * Geppino Pucci, Univ. Padova * Christian Scheideler, Univ. Paderborn * Nir Shavit, Tel Aviv Univ. * Berthold Vocking, RWTH Aachen o * Gerhard Weikum, MPI-Saarbrucken Workshops Chair: * Ralf Klasing, CNRS & Univ. Bordeaux (LaBRI) & INRIA Publicity Chair: * Nicolas Bonichon, Univ. Bordeaux (LaBRI) & INRIA * Lionel Eyraud-Dubois, INRIA & Univ. Bordeaux (LaBRI) Conference Secretariat: * Laetitia Grimaldi, INRIA, Bordeaux ICALP 2010 is organised by the INRIA Bordeaux - Sud-Ouest research center in collaboration with the LaBRI, computer science laboratory of CNRS and the University of Bordeaux. =========================================================================== 5. (from Ernst-Erich Doberkat) Book announcement - Stochastic Coalgebraic Logic: Ernst-Erich Doberkat (Technische Universitat Dortmund, Germany): Stochastic Coalgebraic Logic. EATCS Monographs in Theoretical Computer Science. ISBN 978-3-642-02994-3 , ca. 245 pp., 11/2009, Euro 79.95, US$ 99.00 Coalgebraic logic is an important research topic in the areas of concurrency theory, semantics, transition systems and modal logics. It provides a general approach to modeling systems, allowing us to apply important results from coalgebras, universal algebra and category theory in novel ways. Stochastic systems provide important tools for systems modeling, and recent work shows that categorical reasoning may lead to new insights, previously not available in a purely probabilistic setting. This book combines coalgebraic reasoning, stochastic systems and logics. It provides an insight into the principles of coalgebraic logic from a categorical point of view, and applies these systems to interpretations of stochastic coalgebraic logics, which include well-known modal logics and continuous time branching logics. The author introduces stochastic systems together with their probabilistic and categorical foundations and gives a comprehensive discussion of the Giry monad as the underlying categorical construction, presenting many new, hitherto unpublished results. He discusses modal logics, introduces their probabilistic interpretations, and then proceeds to an analysis of Kripke models for coalgebraic logics. Table of Contents Borel Sets, Measures and All That; Modal Logics; The Giry Monad: Randomized Morphisms; Coalgebraic Logic; Logics: The Grammars; References; List of Symbols; Index For more details see ftp://ls10-ftp.cs.uni-dortmund.de/home/doberkat/public/StochasticRelations/C oalgLogic_Contents.pdf =========================================================================== 6. (from Roy Dyckhoff) Gentzen Centenary Symposium: To celebrate the 100th birthday of Gerhard Gentzen, the founder of proof theory, a Gentzen Centenary Symposium will be held on Tuesday 24 November 2009 in St Andrews (Scotland). The aim is to cover some (but not all) topics relating to his and his work's contributions to and influence on logic, mathematics and computer science. Details are at http://www.cs.st-andrews.ac.uk/~rd/seminars/GCS.html which will be updated with changes (including abstracts) in due course. =========================================================================== 7. (from Roman Spanek) SOFSEM 2010 - Call for Participation: Dear colleague, allow us to inform you and to invite you to participate in : = S O F S E M 2 0 1 0 = : 36th Conference on Current Trends in Theory and Practice of Computer Science January 23-29, 2010, Hotel Bedrichov, Špindlerův Mn, Czech Republic PLEASE REGISTER at: http://www.sofsem.cz : = C A L L F O R P A R T I C I P A T I O N = : SOFSEM (originally SOFtware SEMinar) is the annual international conference devoted to the theory and practice of computer science. Its aim is to present advanced research and to foster the cooperation among researchers from academia and industry in all modern areas of computer science. SOFSEM 2010 consists of the following 4 tracks, with leading experts as invited speakers in each track: - Foundations of Computer Science Chair: David Peleg (Rehovot, Israel) Co-chair: Anca Muscholl (Bordeaux, France) Invited speakers: - Parosh Aziz Abdulla (Uppsala, Sweden) - Yishay Mansour (Tel Aviv, Israel) - Roger Wattenhofer (Zurich, Switzerland) - Principles of Software Construction Chair: Bernhard Rumpe (Aachen, Germany) Invited speakers: - Oscar Nierstrasz (Bern, Switzerland) - Andy Schürr (Darmstadt, Germany) - Arie van Deursen (Delft, The Netherlands) - Data, Knowledge, and Intelligent Systems Chair: Jaroslav Pokorný (Prague, Czech Republic) Invited speakers: - Theo Härder (Kaiserslautern, Germany) - Ondrej Kuželka and Filip Železný (Prague, Czech Republic) - Yannis Manolopoulos (Thessaloniki, Greece) - Web Science Chair: Jan van Leeuwen (Utrecht, The Netherlands) Invited speakers: - Dave Raggett (Sophia-Antipolis, France/UK) - Guus Schreiber (Amsterdam, The Netherlands) For PhD students, there is the: - Student Research Forum Chair: Mária Bieliková (Bratislava, Slovakia) PROGRAM: The conference program includes (for details see http://www.sofsem.cz/sofsem10/index.php?page=preliminary): * 11 invited speaker talks * 53 regular contribution talks * 12 Student Research Forum presentations PROCEEDINGS: The proceedings of SOFSEM 2010 containing the invited and contributed papers will be published in the series Lecture Notes of Computer Science (LNCS) of Springer and will be available at the conference. REGISTRATION: Please follow this link (http://www.sofsem.cz/sofsem10/index.php?page=registration) to register for SOFSEM 2010. The following deadlines are actual: - early registration November 09, 2009, - late registration January 20, 2010, - on-site registration after January 20, 2010. ORGANISED BY: * Institute of Computer Science, Academy of Sciences of the Czech Republic * Faculty of Mathematics and Physics, Charles University in Prague * Action-M Agency. We look forward to see you at SOFSEM 2010! Jan van Leeuwen SOFSEM 2010 General Chair, Roman Spanek SOFSEM 2010 Organising Committee Chair. =========================================================================== 8. (from Moshe Vardi) Five years of Logical Methods in Computer Science: Dear Colleague: We would like to bring the community up to date on the journal Logical Methods in Computer Science www.lmcs-online.org We started this fully refereed, open access, free electronic journal in January 2005, intending to create a high-level platform for publications in all theoretical and practical areas in computer science involving logical methods, taken in a broad sense. We are now on Issue 3 of Volume 5 (there are four issues a year). So far, we have received more than 350 submissions of which we have published 162. In addition to individual submissions, our journal publishes special issues, e.g., of selected papers of high-level international conferences such as LICS, IJCAR, CAV, CSL, and RTA. We are continuing actively to develop the journal. For example, we accept survey articles, and are developing `live' surveys, which can be continually updated as knowledge progresses. In another direction, we are considering allowing authors to provide additional material of an expository nature, such as slides and videos, to enable them to interest a wider spectrum of readers in their contribution. The journal is an overlay of CoRR, the computer science repository of arXiv. There are no fees for authors nor for readers. Every paper is refereed by two or more referees, and high standards are applied. The editorial board consists of about sixty top specialists in all areas of logic in computer science. The journal is covered by Mathematical Reviews, the ISI Web of Knowledge, and the DBLP Database. We welcome your comments and suggestions, and we seek your contributions! For more information please consult our web pages: www.lmcs-online.org Yours, Editor-in-Chief: Dana S. Scott Managing Editors: Benjamin C. Pierce Gordon D. Plotkin Moshe Y. Vardi Executive Editors: Jiri Adamek Stefan Milius =========================================================================== 9. (from Dirk Pattinson) One PhD and one Postdoc Position in Coalgebraic Logics: ------------------------------------------------------ One PhD and one postdoc position in Coalgebraic Logics ------------------------------------------------------ Department of Computing Imperial College London Applications are invited for one PhD position and one postdoctoral position within the theory section at the Department of Computing, Imperial College London. Both positions are available for three years and funded by the EPSRC within the project ``Cool: Coalgebras, Ontologies and Logic'' starting March 1, 2010 or as soon as possible thereafter. The goal of the project is to investigate both foundations and applications of knowledge representation using coalgebraic logics. For details please see http://www.doc.ic.ac.uk/~dirk/COOL/ which also links to the official job adverts, or email me (dirk@doc.ic.ac.uk) for informal enquiries. Best regards, Dirk Pattinson. =========================================================================== 10. (from Peter Hertling) J.UCS Special Issue CCA 2009: First Call for Papers: ______________________________________________________________ Call for Submissions for the Special issue of J.UCS on Computability and Complexity in Analysis Submission deadline: December 14, 2009 ______________________________________________________________ The Sixth International Conference on Computability and Complexity in Analysis (CCA 2009) took place from August 18-22, 2009, in Ljubljana, Slovenia, see http://cca-net.de/cca2009/ There will be a special issue following CCA 2009 in the Journal of Universal Computer Science (J.UCS), which is an ISI listed ( see http://www.isiknowledge.com ) open access journal, see http://www.jucs.org Papers not presented at CCA 2009 may also be considered for submission. All papers will be refereed according to the usual scientific standards. Submitted papers must not be previously published nor submitted for publication elsewhere. The number of papers that can be accepted in this special issue is limited. All submitted papers should be prepared already with the LaTeX style file of JUCS, see http://www.jucs.org/jucs_info/submissions PDF versions of papers for this special issue can be submitted via the following EasyChair page: http://www.easychair.org/conferences/?conf=cca2009publ It is planned that the publication of this special issue follows the following schedule: Deadline for submissions: December 14, 2009. Notification date: March 15, 2010. Final versions due: April 19, 2010. Andrej Bauer Peter Hertling Ker-I Ko (Guest Editors of the JUCS Special Issue) =========================================================================== 11. (from Joao Paulo Barros) PETRI NETS 2010 - First Call for Papers: FIRST CALL FOR PAPERS PETRI NETS 2010 31st International Conference on Application and Theory of Petri Nets and other Models of Concurrency June 21-25, 2010 Braga, Portugal Web: http://petrinets2010.di.uminho.pt/ Email : petrinets2010[@]di[.]uminho[.]pt Collocated with ACSD 2010: 10th International Conference on Application of Concurrency to System Design (http://acsd2010.di.uminho.pt) Common page at http://acsd-petrinets2010.di.uminho.pt The call for papers is available at http://www.informatik.uni-hamburg.de/TGI/PetriNets/meetings/pn2010/ INVITED SPEAKERS In 2010, the PETRI NETS and the ACSD conferences will feature five keynote speakers of international reputation: - David Harel (Distinguished Carl Adam Petri Lecture) - Kim Guldstrand Larsen - Gabriel Juhas - Maciej Koutny - Lars M. Kristensen More information is available at http://acsd-petrinets2010.di.uminho.pt/?page=InvitedSpeakers WORKSHOPS AND TUTORIALS The workshops below have been accepted for PETRI NETS / ACSD 2010. All workshops will take place on June 21 and/or June 22. - Abstractions for Petri Nets and Other Models of Concurrency (APNOC) Organizers: Alexander Serebrenik and Natalia Sidorova. - Petri Nets and Software Engineering (PNSE) Organizers: Michael Duvigneau and Daniel Moldt. - Biological Processes & Petri Nets (BioPPN) Organizers: Claudine Chaouiya and Monika Heiner. - Scalable and Usable Model checking for petri nets and Other models of concurrency (SUMo) Organizers: D. Buchs, F. Kordon, Y. Thierry-Megg, J. Sproston - Foundations of Interface Technologies (FIT2010) Organizers: B. Caillaud and A. Legay =========================================================================== 12. (from Barry Cooper) FP7 ICT Call 6: The FP7 ICT Call 6 offers a collaborative research funding opportunity for researchers with an interest in information and communication technologies.   The 6th call for proposals is scheduled to open on the 24th November 2009 and has a budget of 286m euros.  The deadline for submitting applications to this funding stream is expected to be 13 April 2010.  Details of the call including the research topics for which funding will be made available are given on pages 120-122 of the ICT Work Programme which is downloadable from the Information Package on the following website: http://cordis.europa.eu/fp7/dc/index.cfm?fuseaction=UserSite.CooperationDeta ilsCallPage&call_id=232 =========================================================================== Items for the next CiE Newsletter should be sent to s.b.cooper@leeds.ac.uk to arrive by November 15, 2009 ___________________________________________________________________________ ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk CiE Conference Series http://www.illc.uva.nl/CiE CiE 2010 http://www.cie2010.uac.pt/ CiE Membership Application Form http://www.cs.swan.ac.uk/acie ___________________________________________________________________________