LANOTTE RUGGERO | Università degli studi dell'Insubria

E-mail

Numero telefonico

031 238 6268

Date of birth: October 29, 1974
Nationality: Italian
Languages: French, English

Laurea in Informatica cum laude, University of Pisa 1999; Title: ``Automi Temporizzati Comunicanti''; supervisors: Prof. Andrea Maggiolo-Schettini and Dr. Adriano Peron.

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

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

Guest Researcher (10/1/2003 - 12/15/2003, 1/06/2005-30/06/2005, 1/06/2007-1/07/2007, 1/06/2009-1/7/2009), LACL, University of Paris XII, France

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

Ricerca

Portale IRInSubria

Pubblicazioni in evidenza

Riviste Internazionali

R. Lanotte, M. Merro: A semantic theory of the Internet of Things. Information & Computation 259(1): 72-101 (2018)
R. Lanotte, M. Merro, S. Tini: Equational Reasonings in Wireless Network Gossip Protocols. Logical Methods in Computer Science 14(3) (2018)
V. Castiglioni, R. Lanotte, S. Tini: A Function Elimination Method for Checking Satisfiability of Arithmetical Logics. Fundamenta Informaticae 143, 51-71 (2016).
V. Castiglioni, R. Lanotte, S. Tini: A Specification Format for Rooted Branching Bisimulation. Fundamenta Informaticae 135, 355-369 (2014).
D. Beauquier, J. Cohen and R. Lanotte. Security policies enforcement using finite and pushdown edit automata. International Journal Information Security, 12, 319-336 (2013)
C. Dima, R. Lanotte: A study on shuffle, stopwatches and independently evolving clocks. Distributed Computing, 5, 33-25 (2012).
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo Troina: Reachability results for timed automata with unbounded data structures. Acta Inf. 47(5-6): 279-311 (2010)
L. Bozzelli and R. Lanotte: Complexity and succinctness issues for linear-time hybrid logics. Theoretical Computer Science, 411(2), Elsevier, Amsterdam, 2010, 454-469.
R. Lanotte, A. Maggiolo-Schettini, P. Milazzo and A. Troina: Design and Verification of Long-Running Transactions in a Timed Framework" Science of Computer Programming 73 (2-3) 76-94 (2009).
R. Lanotte and S. Tini: Probabilistic Bisimulation as a Congruence. ACM Transactions on Computational Logic 10 (2009).
R. Lanotte: Expressive Power of Hybrid Systems with Real Variables, Integer Variables and Arrays. Journal of Automata, Languages and Combinatorics 12 (2007) 3, 373
405.
R. Lanotte and S. Tini: Taylor Approximations for Hybrid Systems. Information and Comupation, 205, pp. 1575-1607.
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo Troina: Parametric probabilistic transition systems for system design and analysis. Formal Asp. Comput. 19(1): 93-109 (2007)
R. Lanotte e A. Maggiolo-Schettini: Monotonic Hybrid Systems, Journal of Computer and System Sciences 71, Elsevier, Amsterdam, 2005, 34-69.
R. Lanotte, A. Maggiolo-Schettini e S. Tini : Information Flow in Hybrid Systems. ACM Transactions on Embedded Computer Systems 3(4), 760-799, ACM Press, New York, 2004.
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.
R. Lanotte, A. Maggiolo-Schettini, e S. Tini: Epsilon-Transitions in Councurrent Timed Automata. Information Processing Letters 89(1), Elsevier, Amsterdam, 2004, 1-7.
R. Lanotte, A. Maggiolo-Schettini, e S. Tini: Concurrency in Timed Automata. Theoretical Computer Science, 309(1-3), Elsevier, Amsterdam, 2003, 503-527.
R. Lanotte, A. Maggiolo-Schettini, A. Peron e S. Tini: Dynamic Hierarchical Machines. Fundamenta Informaticae, 54 (2003), pp. 237-252.
R. Lanotte, A. Maggiolo-Schettini, A. Peron e S. Tini : Transformations of Timed Cooperating Automata Fundamenta Informaticae 47 (2001), pp. 271-282.
R. Lanotte, A. Maggiolo-Schettini e A .Peron : Timed Cooperating Automata Fundamenta Informaticae 43, pp. 153-173.

Congressi Internazionali

R. Lanotte, M. Merro, A. Munteanu: A Modest Security Analysis of Cyber-Physical Systems: A Case Study. FORTE 2018: 58-78
R. Lanotte, S. Tini: Weak Bisimulation Metrics in Models with Nondeterminism and Continuous State Spaces. ICTAC 2018: 292-312
R. Lanotte, M. Merro, S. Tini: Towards a Formal Notion of Impact Metric for Cyber-Physical Attacks. IFM 2018: 296-315
R. Lanotte, M. Merro, R. Muradore, L. Viganò: A Formal Approach to Cyber-Physical Attacks. CSF 2017: 436-450
R. Lanotte, M. Merro, S. Tini: Weak Simulation Quasimetric in a Gossip Scenario. FORTE 2017: 139-155
R. Lanotte, M. Merro: A Calculus of Cyber-Physical Systems. LATA 2017: 115-127
R. Lanotte, M. Merro: A Semantic Theory of the Internet of Things - (Extended Abstract). COORDINATION 2016, Lecture Notes in Computer Science 157-174
Ruggero Lanotte, Massimo Merro: Semantic Analysis of Gossip Protocols for Wireless Sensor Networks. CONCUR 2011: 156-170
Laura Bozzelli, Ruggero Lanotte: Hybrid and First-Order Complete Extensions of CaRet. TABLEAUX 2011: 58-72
C. Dima and R. Lanotte: Removing All Silent Transitions from Timed Automata. FORMATS 2009, LNCS 5813, 118-132
L. Bozzelli and R. Lanotte. Complexity and Succinctness issues for linear-time hybrid logics. JELIA 2008, LNCS 5293, 48-61.
D. Beauquier, J. Cohen and R. Lanotte. Security policies enforcement using finite edit automata. ICE 2008, ENTCS 229, 19-35.
C. Dima and R. Lanotte: Distributed time-asynchronous automata. ICTAC 2007, LNCS, 4711, pp. 185-200
[FAST06] D. Beauquier and R. Lanotte: Hiding Information in Multi Level Systems, FAST 2006, LNCS 4691, pp. 250
269, 2007.
R. Lanotte e A. Maggiolo-Schettini e P. Milazzo e A. Troina: Modeling Long-Running Transactions with Communicating Hierarchical Timed Automata. FMOODS 06, LNCS 4037, 108-122, 2006.
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.
R.Lanotte e S. Tini: Taylor Approximation for Hybrid Systems. HSCC 2005, LNCS 3414, pp 402-416.
R.Lanotte e S. Tini: Probabilistic Congruence for Generative Semistochastic Process. FOSSACS 2005, LNCS 3441, pp 63-78.
R. Lanotte, A. Maggiolo-Schettini, S. Tini, A. Troina, E. Tronci: Automatic Covert Channel Analsis of a Multilevel Secure Component (ICICS) International Conference on Infor e Communications Security, NCS 3269, pp 249-261.
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.
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.
R. Lanotte: Expressive Power of Hybrid Systems with Variables, Parameters e Arrays. EXPRESS 03, ENTCS 96, pp 91--112
R. 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.
R. Lanotte, A. Maggiolo-Schettini, e S. Tini : Concurrency in Timed Automata. FCT 2001, LNCS 2138, Springer, Berlin, 2001, pp. 240-251.
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
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.