One year industrial research position at the University of Udine about
Modelling and performance evaluation of train on-board networks
Funded by EU FSE program HEaD
Deadline for application: October 10, 2018, 11:30.
Nowadays trains feature advanced on-board information networks which are used both for essential services and for additional (infotainment) services, and must guarantee an adequate level of service quality.
Designing, implementing and validating these networks, respecting precise qualitative and quantitative constraints (bandwidth, delay, fault tolerance, etc.) is complex and error-prone.
The objective of this project is to define practical methods and solutions for modelling train on-board networks, both in the topological and in the quantitative aspects, with the aim to simulate and predict their behavior in various traffic conditions before implementation and deployment. These solutions will use tools and technologies currently developed within the academic community, such as quantitative simulators and model checkers.
Candidates must have a Master degree in Computer Science or Computer Engineering (PhD is not required but appreciated), and a good background in network performance analysis, especially in tools for network simulation / evaluation. Good programming skills will be appreciated.
The selected candidate will work mainly at the Department of Mathematics, Computer Science and Physics (DMIF), of the University of Udine (Italy), in strict cooperation with VDS Rail, a leading industry of the sector.
The total net salary is 20.382,00 euro.
For more information please contact Marino Miculan (firstname.lastname@example.org)
More details about the applications are at the official call.
The EUTypes Summer School is a well-established school aiming to provide advanced training, especially to PhD students and early-career researchers, in all aspects of the theory and practice of type theory and applications.
The call for grants is open until June 20, so if you are interested, apply now!
Giovedì 7 giugno ho tenuto una conferenza intitolata “Bitcoin e crittovalute: dal catasto tavolare alla blockchain“, presso il MIB di Trieste, su invito dell’Ordine degli Ingegneri di Trieste. Grazie a tutti i partecipanti!
The workshop LFMTP 2017 is going to be a nice event. We’ve got many interesting papers, and the session dedicated to Randy Pollack is the cherry on the cake (pun intended)!
Ho appena saputo che il premio del Capitolo Italiano dell’EATCS per la migliore tesi magistrale in informatica teorica del 2016 è stato assegnato alla tesi Le Simulazioni Lasche: Definizione, Applicazioni e Computazione Distribuita di Alessio Mansutti, di cui sono stato relatore (e Marco Peressotti correlatore).
The Call for Papers for the 2017 edition of “Logical Frameworks and Meta Languages:
Theory and Practice.” is out: see the workshop webpage.
This year LFMTP is hosted by FSCD 2017 and co-located with ICFP 2017 and other 10 workshops: EUTypes, HDRA, HoTT, IFIP, IWC, SD, String, TLLA, UNIF and WPTE. September will be great in Oxford, so submit to LFMTP 2017.
I am honored to serve in the Program Committee of the Special Track on Coordination Models, Languages and Applications of the ACM SAC 2016 conference. Please consider to submit your papers about models, formalisms and mechanisms to describe concurrent and distributed computations, in due time!
The program of the 2nd International Workshop on Meta Models for Process Languages (MeMo 2015) is online at http://discotec2015.inria.fr/memo-2015/.
The paper Structural Operational Semantics for Continuous State Stochastic Transition Systems by Giorgio Bacci and myself has been published on Journal of Computer and System Sciences 81 (2015).
Mercoledì 28 maggio alle 9:30 in Sala Riunioni del DiMI, il dott. Filippo Bonchi, Chargé de Recherche CNRS presso l’Ecole Normale Supérieure di Lione, terrà il seguente seminario riguardante recenti suoi risultati:
Coinduction Up-To (and some applications to equivalence checking)
Abstract: Coinduction proof principles, and their enhancements by means of up-to techniques, are widely used for reasoning about automata and processes. In this talk, I will consider bisimulation up-to congruence as a technique for proving language equivalence of non-deterministic finite automata. This technique can be effectively implemented in an algorithm that exponentially improves the state of the art.
Tutti gli interessati sono invitati a partecipare.