Ruggero Lanotte

According to our database1, Ruggero Lanotte
  • authored at least 58 papers between 2000 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Equational Reasonings in Wireless Network Gossip Protocols.
CoRR, 2017

A Probabilistic Calculus of Cyber-Physical Systems.
CoRR, 2017

A Calculus of Cyber-Physical Systems.
Proceedings of the Language and Automata Theory and Applications, 2017

Weak Simulation Quasimetric in a Gossip Scenario.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2017

2016
A Function Elimination Method for Checking Satisfiability of Arithmetical Logics.
Fundam. Inform., 2016

A Formal Approach to Cyber-Physical Attacks.
CoRR, 2016

A Calculus of Cyber-Physical Systems.
CoRR, 2016

Extending Taylor Approximation to Hybrid Systems with Integrals.
Proceedings of the 25th International Workshop on Concurrency, 2016

A Semantic Theory of the Internet of Things - (Extended Abstract).
Proceedings of the Coordination Models and Languages, 2016

2015
A Semantic Theory for the Internet of Things.
CoRR, 2015

2014
A Specification Format for Rooted Branching Bisimulation.
Fundam. Inform., 2014

A Function Elimination Method for Checking Satisfiability of Arithmetical Logics.
Proceedings of the 23th International Workshop on Concurrency, Specification and Programming, Chemnitz, Germany, September 29, 2014

2013
Security policies enforcement using finite and pushdown edit automata.
Int. J. Inf. Sec., 2013

A Rule Format for Rooted Branching Bisimulation.
Proceedings of the 22nd International Workshop on Concurrency, 2013

2012
A study on shuffle, stopwatches and independently evolving clocks.
Distributed Computing, 2012

2011
Hybrid and First-Order Complete Extensions of CaRet.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2011

Semantic Analysis of Gossip Protocols for Wireless Sensor Networks.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010
Time and Probability-Based Information Flow Analysis.
IEEE Trans. Software Eng., 2010

Weak bisimulation for Probabilistic Timed Automata.
Theor. Comput. Sci., 2010

Complexity and succinctness issues for linear-time hybrid logics.
Theor. Comput. Sci., 2010

Reachability results for timed automata with unbounded data structures.
Acta Inf., 2010

2009
Probabilistic bisimulation as a congruence.
ACM Trans. Comput. Log., 2009

A Decidable Probability Logic for Timed Probabilistic Systems.
Fundam. Inform., 2009

Security Policies Enforcement Using Finite Edit Automata.
Electr. Notes Theor. Comput. Sci., 2009

Removing All Silent Transitions from Timed Automata.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2009

2008
Design and verification of long-running transactions in a timed framework.
Sci. Comput. Program., 2008

Complexity and Succinctness Issues for Linear-Time Hybrid Logics.
Proceedings of the Logics in Artificial Intelligence, 11th European Conference, 2008

2007
Expressive Power of Hybrid Systems with Real Variables, Integer Variables and Arrays.
Journal of Automata, Languages and Combinatorics, 2007

Taylor approximation for hybrid systems.
Inf. Comput., 2007

Parametric probabilistic transition systems for system design and analysis.
Formal Asp. Comput., 2007

Distributed Time-Asynchronous Automata.
Proceedings of the Theoretical Aspects of Computing, 2007

2006
A Classification of Time and/or Probability Dependent Security Properties.
Electr. Notes Theor. Comput. Sci., 2006

Hiding Information in Multi Level Security Systems.
Proceedings of the Formal Aspects in Security and Trust, Fourth International Workshop, 2006

Modeling Long-Running Transactions with Communicating Hierarchical Timed Automata.
Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 2006

2005
Monotonic hybrid systems.
J. Comput. Syst. Sci., 2005

Automatic Analysis of a Non-Repudiation Protocol.
Electr. Notes Theor. Comput. Sci., 2005

Timed Automata with Data Structures for Distributed Systems Design and Analysis.
Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (SEFM 2005), 2005

Taylor Approximation for Hybrid Systems.
Proceedings of the Hybrid Systems: Computation and Control, 8th International Workshop, 2005

Probabilistic Congruence for Semistochastic Generative Processes.
Proceedings of the Foundations of Software Science and Computational Structures, 2005

2004
Information flow in hybrid systems.
ACM Trans. Embedded Comput. Syst., 2004

Epsilon-transitions in Concurrent Timed Automata.
Inf. Process. Lett., 2004

Automated analysis of timed security: a case study on web privacy.
Int. J. Inf. Sec., 2004

Automatic Analysis of the NRL Pump.
Electr. Notes Theor. Comput. Sci., 2004

Expressive Power of Hybrid Systems with Variables, Parameters and Arrays.
Electr. Notes Theor. Comput. Sci., 2004

A Decidable Probability Logic for Timed Probabilistic Systems
CoRR, 2004

Decidability Results for Parametric Probabilistic Transition Systems with an Application to Security.
Proceedings of the 2nd International Conference on Software Engineering and Formal Methods (SEFM 2004), 2004

Structural Model Checking for Communicating Hierarchical Machines.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Information Flow Analysis for Probabilistic Timed Automata.
Proceedings of the Formal Aspects in Security and Trust: Second IFIP TC1 WG1.7 Workshop on Formal Aspects in Security and Trust (FAST), 2004

Automatic Covert Channel Analysis of a Multilevel Secure Component.
Proceedings of the Information and Communications Security, 6th International Conference, 2004

2003
Concurrency in timed automata.
Theor. Comput. Sci., 2003

Dynamic Hierarchical Machines.
Fundam. Inform., 2003

Weak Bisimulation for Probabilistic Timed Automata and Applications to Security.
Proceedings of the 1st International Conference on Software Engineering and Formal Methods (SEFM 2003), 2003

2001
Transformations of Timed Cooperating Automata.
Fundam. Inform., 2001

Privacy in Real-Time Systems.
Electr. Notes Theor. Comput. Sci., 2001

Formal Models of Timing Attacks on Web Privacy.
Electr. Notes Theor. Comput. Sci., 2001

Concurrency in Timed Automata.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000
Timed Cooperating Automata.
Fundam. Inform., 2000

Timed Automata with Monotonic Activities.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000


  Loading...