Category Archives: News

28/01/2015 – Workshop on mobile agents and robots


January, 28th 9.30-12.30, Room 1, Bulding Z, Campus Scientifico


9.30-9.35 Workshop presentation.

9.35-10.20 Prof. Evangelos Kranakis Carleton University, Ottawa, Canada: “Evacuating Robots from an Unknown Exit in a Disk”.

Consider k mobile robots inside a circular disk of unit radius. The robots are required to evacuate the disk through an unknown exit point situated on its boundary. We assume all robots having the same (unit) maximal speed and starting at the centre of the disk. The robots may communicate in order to inform themselves about the presence (and its position) or the absence of an exit. The goal is for all the robots to evacuate through the exit in minimum time.

We consider two models of communication between the robots: in non-wireless (or localcommunication model robots exchange information only when simultaneously located at the same point, and wireless communication in which robots can communicate one another at any time. We study the following question for different values of k: what is the optimal evacuation time for k robots? We provide algorithms and show lower bounds in both communication models for k=2 and k=3 thus indicating a difference in evacuation time between the two models. We also obtain almost-tight bounds on the asymptotic relation between evacuation time and team size, for large k. We show that in the local communication model, a team of k robots can always evacuate in time 3 + (2Π)/k, whereas at least 3 + (2Π)/k – O(k^{-2}) time is sometimes required. In the wireless communication model, time 3 + Π/k + O(k^{-4/3}) always suffices to complete evacuation, and at least 3+ Π/k is sometimes required. This shows a clear separation between the local and the wireless communication models.


10.25-11.10 Prof. Danny Krizanc Wesleyan University, Middletown, CT, U.S.A.: “The Dynamic Map Visitation Problem: Foremost Coverage of Time-varying Graphs.”

We consider the Dynamic Map Visitation Problem (DMVP), in which a team of agents must visit a collection of critical locations as quickly as possible, in an environment that may change rapidly and unpredictably during the agents’ navigation. We apply recent formulations of time-varying graphs (TVGs) to DMVP, shedding new light on the computational hierarchy R ⊃ B ⊃ P of TVG classes by analyzing them in the context of graph navigation. We provide hardness results for all three classes, and for several restricted topologies, we show a separation between the classes by showing severe inapproximability in R, limited approximability in B, and tractability in P. We also give topologies in which DMVP in R is fixed parameter tractable, which may serve as a first step toward fully characterizing the features that make DMVP difficult.

11.10-11.40 coffee break (registration is required).

11.40-12.10 PhD students demos with LEGO MINDSTORMS Robots.

EPEW 2013 – In Venice

The European Workshop on Performance Engineering 2013 will be held in Venice on 16-17 September. The Deadline for the submission is May, 25th.
The European Performance Engineering Workshop is an annual event that aims to gather academic and industrial researchers working on all aspects of performance engineering. Original papers related to theoretical and methodological issues as well as case studies and automated tool support are solicited in the following three areas: Performance Modelling and Evaluation, System and network performance engineering, Software performance engineering.

See the call for papers
See the event website

Call for PhD positions – deadline May, 27th

Ca’ Foscari University of Venice announces 10 PhD positions (6 with scholarship) in Computer Science. The Doctoral programme in Computer Science trains scholars to design, develop and lead academic and industrial research projects. It provides students with the formal background and tools needed to perform research in a rigorous way, and with the methodologies for the design and evaluation of IT systems and applications.

See the call

20.03.2013 – EACTS best paper award!

Good news from ETAPS 2013!

The paper

Logical Foundations of Secure Resource Management in Protocol Implementations
by Michele Bugliesi, Stefano Calzavara, (Univ. Ca’ Foscari, ACADIA),
Fabienne Eigener, Matteo Maffei (Univ. of Saarland)

has been awarded the EATCS Best Paper prize  at ETAPS 2013, the European Joint Conference on Theory and Practice of Software, which includes the following conferences:

International Conference on Compiler Construction (CC)
European Symposium on Programming (ESOP)
Int. Conference on Fundamental Approaches to Software Engineering (FASE)
Int. Conference on Foundations of Software Science and Computation Structures (FoSSaCS)
International Conference on Principles of Security and Trust (POST)
Int. Conference on Tools and Algorithms for the Construction and Analysis of Systems  (TACAS)

The prize is awarded by the European Association for Theoretical Computer Science EATCS  to the best  theoretical paper amongst the papers presented at all the ETAPS conferences.

Open postdoc fellowship

We are seeking to recruit a post-doc fellow to conduct integrative theoretical and experimental research in modelling principles and analysis techniques for distributed and pervasive systems.

Requirements: Applicants must hold a Ph.D degree in Computer Science or related subject before the application deadline. The successful candidate will submit a scientifically excellent research proposal,  relevant to the topics of the call, and display:

  • Scientific knowledge across the relevant subjects,
  • Technical competence and a strong publication record,
  • Team working skills,
  • Leadership experience,
  • Ability to organize her/him self and others.

Funding: is for one year, renewable, at approximately 24,000 Euro gross, including mobility allowances (that corresponds to around 21,000 Euro net). The fellowship is expected to start in May / June 2013

See this page for full detalis.

08.02.2013 – Kick off progetto SmeD

Kick off progetto SmeD

Venerdì 8 febbraio 2013, ore 11:00, presso l’Università “Ca’ Foscari” di Venezia, al Dipartimento di Scienze Ambientali, Informatica e Statistica (DAIS) di Via Torino 155, Mestre-Venezia.


  1. Saluti e presentazione del DAIS
    Prof. Michele Bugliesi,
    Direttore DAIS, Università “Ca’ Foscari” di Venezia
  2. Gli obiettivi della collaborazione con l’Università “Ca’ Foscari” di Venezia
    Ing. Elvio Tasso,
    Direttore Sistemi Informativi della Regione del Veneto
  3. Il Laboratorio di eGovernment di Regione Veneto ed Università
    Prof. Agostino Cortesi, DAIS
    Responsabile Scientifico SmeD
  4. Il Progetto SmeD: struttura e pianificazione
    Dott. Antonio Candiello, DAIS
    Coordinatore del Progetto SmeD
  5. L’infrastruttura applicativa della Regione Veneto
    Ing. Andrea Boer
    Responsabile Unità Complessa e-Government e Società dell’Informazione
  6. Gli obiettivi a medio termine “di produzione” del progetto SmeD
    Dott. Antonino Mola,
    Responsabile PO “Sviluppo Piani e Programmi per la Società dell’Informazione”