Assistant Professor
Department of Computer Science and Communication
Via Carloni 78, Como I-22100, Italy
Tel: +39-031-2386268
Fax: +39-031-2386119
E-mail: ruggero.lanotte@uninsubria.it

Date of birth: October 29, 1974
Born in: Porto San Giorgio (AP), Italy
Nationality: Italian
Languages: French, English
Address: via Rossini 10, I-63010 Campofilone (AP), Italy

Research Associate (2/1/2003 - 1/31/2004) Department of Computer Science, University of Pisa, Italy

Guest Researcher (10/1/2003 - 12/15/2003), LACL, University of Paris XII, France

Assistant Professor (2/1/2004 - present ) University of Insubria, Italy

PhD at University of Pisa, 2003, Title:``An automaton-theoretic approach to safety and security in real-time systems''; supervisor: Prof. Andrea Maggiolo-Schettini.

The role of automata for analysing properties of systems is widely recognised. In recent years classes of automata for the specification and verification of real-time systems have been introduced both with discrete time and with dense time assumption (e.g. Timed Automata, Timed Cooperating Automata, Timed Automata with Non-instantaneous Actions, Hybrid Automata).

Explicit representation of time seems to be essential for specifying and verifying many systems. Among these there are: control systems, smart cards, communications by mobile phones, transactions via web.

It is also interesting the use of automata to model probabilistic aspects of the system under consideration, possibly towards the end of specifying and verifying properties.

Many complex systems have a hierarchical structure, and thus this structure should also be a feature of formalisms, in order to ensure an adequate modelling. The feature of hierarchy together with the ability of representing parallel composition came to prominence in Finite State Machines with the introduction of the specification formalism Statecharts and has been adopted in many specification formalisms, such as Modecharts and Rsml, and are a central component of various object oriented software development methodologies (e.g. see the Unified Modelling Language).

In multilevel systems it is important to avoid unwanted indirect information flow from higher levels to lower levels, namely the so called covert channels. Initial studies of information flow analysis were performed by abstracting away from time and probability. It is already known that systems that are considered to be secure may turn out to be insecure when time or probability are considered. Recently, work has been done in order to consider also aspects either of time or of probability, but not both.

Courses taught:
• Architettura degli Elaboratori e delle Reti I e Complementi (Architecture of Computer Systems), 2004-2005 and 2005-2006, University of Insubria.
• Automi e Linguaggi (Automata and Languages), 2004-2005 and 2005-2006, University of Insubria.
• Logica Computazionale I (Computational Logic I), 2004-2005, University of Insubria.
• Laboratorio di Informatica (Laboratory of Informatics), 2005-2006, University of Insubria.

2. R. Lanotte, A. Maggiolo-Schettini e S. Tini : Information Flow in Hybrid Systems. ACM Transactions on Embedded Computer Systems 3(4), ACM Press, New York, 2004.

3. R. Gorrieri, R. Lanotte, A. Maggiolo-Schettini, F. Martinelli, S. Tini, e E. Tronci: Automated Analysis of Timed Security: A Case Study on Web Privacy. International Journal of Information Security, 2 (3-4), Springer-Verlag, Heidelberg, 2004, 168-186.

4. R. Lanotte, A. Maggiolo-Schettini, e S. Tini: Epsilon-Transitions in Councurrent Timed Automata. Information Processing Letters 89(1), Elsevier, Amsterdam, 2004, 1-7.

5. R. Lanotte, A. Maggiolo-Schettini, e S. Tini: Concurrency in Timed Automata. Theoretical Computer Science, 309(1-3), Elsevier, Amsterdam, 2003, 503-527.

6. R. Lanotte, A. Maggiolo-Schettini, A. Peron e S. Tini: Dynamic Hierarchical Machines. Fundamenta Informaticae, 54 (2003), pp. 237-252.

7. R. Lanotte, A. Maggiolo-Schettini, A. Peron e S. Tini : Transformations of Timed Cooperating Automata Fundamenta Informaticae 47 (2001), pp. 271-282.

8. R. Lanotte, A. Maggiolo-Schettini e A .Peron : Timed Cooperating Automata Fundamenta Informaticae 43, pp. 153-173.

9. R. Lanotte e A. Maggiolo-Schettini e A. Troina: Timed Automata with Data Structures for Distributed Systems Design and Analysis. 3nd Int. Conference on Software Engineering e Formal Methods (SEFM'05), IEEE Computer Society Press, 44-53.

10. R.Lanotte e S. Tini: Taylor Approximation for Hybrid Systems. HSCC 2005, LNCS 3414, pp 402-416.

11. R.Lanotte e S. Tini: Probabilistic Congruence for Generative Semistochastic Process. FOSSACS 2005, LNCS 3441, pp 63-78.

12. R. Lanotte, A. Maggiolo-Schettini, S. Tini, A. Troina, E. Tronci: Automatic Covert Channel Analysis of a Multilevel Secure Component (ICICS) International Conference on Information e Communications Security, LNCS 3269, pp 249-261.

13. R. Lanotte, A. Maggiolo-Schettini, A. Troina: Decidability Results for Parametric Probabilistic Transition Systems with an Application to Security. 2nd Int. Conference on Software Engineering e Formal Methods (SEFM'04), IEEE Computer Society Press, pp. 114-121, Beijing, China, September 2004.

14. R. Lanotte, A. Maggiolo-Schettini, A. Peron : Structural Model Checking for Communicating Hierarchical Machines. 29th International Symposium on Mathematical Foundations of Computer Science, LNCS 3153, pp 525--536.

15. R. Lanotte: Expressive Power of Hybrid Systems with Variables, Parameters e Arrays. EXPRESS 03, ENTCS 96, pp 91--112

16. Lanotte, A. Maggiolo-Schettini, A. Troina: Weak Bisimulation for Probabilistic Timed Automata e Applications to Security. 1st Int. Conference on Software Engineering e Formal Methods (SEFM'03), IEEE Computer Society Press, A. Cerone Ed., pp. 34-43, Brisbane, Australia, September 2003.

17. R. Lanotte, A. Maggiolo-Schettini, e S. Tini : Concurrency in Timed Automata. FCT 2001, LNCS 2138, Springer, Berlin, 2001, pp. 240-251.

18. R. Lanotte, A. Maggiolo-Schettini : Timed Automata with Monotonic Activities. 25th International Symposium on Mathematical Foundations of Computer Science August 28 - September 1, 2000 Bratislava, Slovak Republic, Europe, LNCS 1893, pp. 518-527

19. R. Lanotte, A. Maggiolo-Schettini, A. Troina Information Flow Analysis for Probabilistic Timed Automata 2nd Int. Workshop on Formal Aspects in Security e Trust (FAST'04), IFIP International Federation for Information Processing, vol. 173, 2005.

20. R.Lanotte, A. Maggiolo-Schettini, A. Troina: A Classification of Time and/or Probability Dependent Properties 3rd Int. Workshop on Quantitative Aspects of Programming Languages QAPL 2005, in stampa
.
21. R. Lanotte, A. Maggiolo-Schettini e A. Troina: Automatic Analysis of a Non-Repudiation Protocol 2nd Int. Workshop on Quantitative Aspects of Programming Languages (QAPL 04), Barcelona, Spain, March 2004, ENTCS 112, pp 113-129.

22. R. Lanotte, A. Maggiolo-Schettini, S. Tini, A. Troina: Verification of Hybrid Automata by Synthesis and Refinement. Proc. of the CS&P '04 Workshop, pp 69-80.

23. R. Lanotte, A. Maggiolo-Schettini, S. Tini, A. Troina e E. Tronci: Automatic Analysis of the NRL Pump Mefisto Final Workshop, ENTCS 99, 245-266

24. R. Lanotte, A. Maggiolo-Schettini, A. Peron e S. Tini: Dynamic Hierarchical Machines. Proc. of the CS&P '02 Workshop, Humboldt Universitat Press, Berlin, 2002, pp. 205-216.

25. Damas P. Gruska, R. Lanotte e A. Maggiolo-Schettini: A Contribution to a Classification of timing Attacks on Privacy. MTCS 2002, Brics NS-02-3, pp 97--108.

26. R. Focardi, R. Gorrieri, R. Lanotte, A. Maggiolo-Schettini, F. Martinelli, S. Tini e E. Tronci: Formal Models of Timing Attacks on Web Privacy. TOSCA 2001, Electronic Notes in Theoretical Computer Science 62.

27. R. Lanotte, A. Maggiolo-Schettini, e S. Tini : Privacy in Real-Time Systems. MTCS 2001, Electronic Notes in Theoretical Computer Science 52.

28. R. Lanotte, A. Maggiolo-Schettini, A. Peron e S. Tini : Transformations of Timed Cooperating Automata. Proc. of the CS&P '00 Workshop, H.-D. Burkhard, L. Czaja, A. Skowron, P. Starke (Eds.), Berlin 2000, pp. 105-116

29. R. Lanotte, A. Maggiolo-Schettini e A. Peron: Timed Cooperating Automata. Proc. of the CS&P '99 Workshop, Warsaw University Press, Warsaw, 1999, pp. 96-106