Simone Tini

Orcid: 0000-0002-3991-5123

Affiliations:
  • University of Insubria, Italy


According to our database1, Simone Tini authored at least 87 papers between 1996 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Back to the format: A survey on SOS for probabilistic processes.
J. Log. Algebraic Methods Program., February, 2024

Measuring Robustness in Cyber-Physical Systems under Sensor Attacks.
CoRR, 2024

2023
A framework to measure the robustness of programs in the unpredictable environment.
Log. Methods Comput. Sci., 2023

Step-by-step Robustness for Biochemical Networks.
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

DisTL: A Temporal Logic for the Analysis of the Expected Behaviour of Cyber-Physical Systems.
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

Quantitative Robustness Analysis of Sensor Attacks on Cyber-Physical Systems.
Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control, 2023

Stark: A Software Tool for the Analysis of Robustness in the unKnown Environment.
Proceedings of the Coordination Models and Languages, 2023

2022
RobTL: A Temporal Logic for the Robustness of Cyber-Physical Systems.
CoRR, 2022

EvTL: A Temporal Logic for the Transient Analysis of Cyber-Physical Systems.
CoRR, 2022

2021
A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces.
Theor. Comput. Sci., 2021

Theoretical Computer Science in Italy.
Theor. Comput. Sci., 2021

Preface to Special Issue: EXPRESS/SOS 2018.
Inf. Comput., 2021

A probabilistic calculus of cyber-physical systems.
Inf. Comput., 2021

How Adaptive and Reliable is Your Program?
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2021

Formal Impact Metrics for Cyber-physical Attacks.
Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

2020
Probabilistic divide & congruence: Branching bisimilarity.
Theor. Comput. Sci., 2020

The metric linear-time branching-time spectrum on nondeterministic probabilistic processes.
Theor. Comput. Sci., 2020

Raiders of the lost equivalence: Probabilistic branching bisimilarity.
Inf. Process. Lett., 2020

CospanSpan(Graph): a Compositional Description of the Heart System.
Fundam. Informaticae, 2020

Preface to special issue: EXPRESS/SOS 2016 + 2017.
Acta Informatica, 2020

Measuring Adaptability and Reliability of Large Scale Systems.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Engineering Principles, 2020

Compositional Modeling of Biological Systems in CospanSpan(Graph).
Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

2019
Logical characterization of branching metrics for nondeterministic probabilistic transition systems.
Inf. Comput., 2019

Computing Bisimilarity Metrics for Probabilistic Timed Automata.
Proceedings of the Integrated Formal Methods - 15th International Conference, 2019

Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics.
Proceedings of the Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy, 2019

2018
Equational Reasonings in Wireless Network Gossip Protocols.
Log. Methods Comput. Sci., 2018

SOS-based Modal Decomposition on Nondeterministic Probabilistic Processes.
Log. Methods Comput. Sci., 2018

SOS specifications for uniformly continuous operators.
J. Comput. Syst. Sci., 2018

Towards a formal notion of impact metric for cyber-physical attacks (full version).
CoRR, 2018

Towards a Formal Notion of Impact Metric for Cyber-Physical Attacks.
Proceedings of the Integrated Formal Methods - 14th International Conference, 2018

Weak Bisimulation Metrics in Models with Nondeterminism and Continuous State Spaces.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2018, 2018

2017
Logical Characterization of Trace Metrics.
Proceedings of the Proceedings 15th Workshop on Quantitative Aspects of Programming Languages and Systems, 2017

Compositional Weak Metrics for Group Key Update.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 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. Informaticae, 2016

Compositional bisimulation metric reasoning with Probabilistic Process Calculi.
Log. Methods Comput. Sci., 2016

Logical Characterization of Bisimulation Metrics.
Proceedings of the Proceedings 14th International Workshop Quantitative Aspects of Programming Languages and Systems, 2016

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

Modal Decomposition on Nondeterministic Probabilistic Processes.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
Compositional Metric Reasoning with Probabilistic Process Calculi.
Proceedings of the Foundations of Software Science and Computation Structures, 2015

SOS Specifications of Probabilistic Systems by Uniformly Continuous Operators.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
Compositional semantics and behavioural equivalences for reaction systems with restriction.
Theor. Comput. Sci., 2014

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

Fixed-point Characterization of Compositionality Properties of Probabilistic Processes Combinators.
Proceedings of the Proceedings Combined 21st International Workshop on Expressiveness in Concurrency, 2014

Systolic Automata and P Systems.
Proceedings of the Computing with New Resources, 2014

2013
Compositionality of Approximate Bisimulation for Probabilistic Systems.
Proceedings of the Proceedings Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics, 2013

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

A Compositional Semantics of Reaction Systems with Restriction.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
Foundational aspects of multiscale modeling of biological systems with process algebras.
Theor. Comput. Sci., 2012

2011
An Overview on Operational Semantics in Membrane Computing.
Int. J. Found. Comput. Sci., 2011

2010
Non-expansive epsilon-bisimulations for probabilistic processes.
Theor. Comput. Sci., 2010

Compositional semantics of spiking neural P systems.
J. Log. Algebraic Methods Program., 2010

Aspects of multiscale modelling in a process algebra for biological systems
Proceedings of the Proceedings Fourth Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2010

Membrane Systems Working in Generating and Accepting Modes: Expressiveness and Encodings.
Proceedings of the Membrane Computing, 2010

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

P Systems with Transport and Diffusion Membrane Channels.
Fundam. Informaticae, 2009

2008
Compositional semantics and behavioral equivalences for P Systems.
Theor. Comput. Sci., 2008

A P Systems Flat Form Preserving Step-by-step Behaviour.
Fundam. Informaticae, 2008

Non Expansive epsilon-Bisimulations.
Proceedings of the Algebraic Methodology and Software Technology, 2008

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

2006
Notes on Generative Probabilistic Bisimulation.
Proceedings of the Third Workshop on Structural Operational Semantics, 2006

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. Embed. Comput. Syst., 2004

Rule formats for compositional non-interference properties.
J. Log. Algebraic Methods Program., 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

Compositional Synthesis of Generalized Mealy Machines.
Fundam. Informaticae, 2004

Timed CCP compositionally embeds Argos and Lustre.
Formal Aspects Comput., 2004

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

2003
A comparison of Statecharts step semantics.
Theor. Comput. Sci., 2003

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

An axiomatic semantics for the synchronous language Gentzen.
J. Comput. Syst. Sci., 2003

Dynamic Hierarchical Machines.
Fundam. Informaticae, 2003

Automatic Analysis of the NRL Pump.
Proceedings of the Formal Methods for Security and Time: Proceedings of the MEFISTO Project 2003, 2003

Rule Formats for Non Interference.
Proceedings of the Programming Languages and Systems, 2003

2002
On disjunction of literals in triggers of statecharts transitions.
Inf. Process. Lett., 2002

2001
An axiomatic semantics for Esterel.
Theor. Comput. Sci., 2001

Transformations of Timed Cooperating Automata.
Fundam. Informaticae, 2001

Privacy in Real-Time Systems.
Proceedings of the International Workshop on Models for Time-Critical Systems, 2001

Formal Models of Timing Attacks on Web Privacy.
Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

2000
A Causal Semantics for Timed Default Concurrent Constraint Programming.
Proceedings of the Algebraic Methodology and Software Technology. 8th International Conference, 2000

1999
Applying Techniques of Asynchronous Concurrency to Synchronous Languages.
Fundam. Informaticae, 1999

On The Expressiveness of Timed Concurrent Constraint Programming.
Proceedings of the 6th International Workshop on Expressiveness in Concurrency, 1999

A Truly Concurrent Semantics for Timed Default Concurrent Constraint Programming.
Proceedings of the Object-Oriented Technology, ECOOP'99 Workshop Reader, 1999

1998
Two semantics for Timed Default Concurrent Constraint Programming.
Proceedings of the Second Workshop on Concurrent Constraint Programming for Time Critical Applications and Multi-Agent Systems, 1998

Projectable Semantics for Statecharts.
Proceedings of the MFCS '98 Workshop on Concurrency, 1998

1996
Equivalences of Statecharts.
Proceedings of the CONCUR '96, 1996


  Loading...