Simone Tini

According to our database1, Simone Tini authored at least 61 papers between 1996 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Equational Reasonings in Wireless Network Gossip Protocols.
Logical Methods in Computer Science, 2018

SOS-based Modal Decomposition on Nondeterministic Probabilistic Processes.
Logical Methods in Computer Science, 2018

SOS specifications for uniformly continuous operators.
J. Comput. Syst. Sci., 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
Compositional bisimulation metric reasoning with Probabilistic Process Calculi.
Logical Methods in Computer Science, 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. Inform., 2014

Fixed-point Characterization of Compositionality Properties of Probabilistic Processes Combinators.
Proceedings of the Proceedings Combined 21st International Workshop on Expressiveness in Concurrency and 11th Workshop on Structural Operational Semantics, 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

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. Algebr. 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. Inform., 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. Inform., 2008

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

2007
Notes on Generative Probabilistic Bisimulation.
Electr. Notes Theor. Comput. Sci., 2007

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

Rule formats for compositional non-interference properties.
J. Log. Algebr. 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. Inform., 2004

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

Automatic Analysis of the NRL Pump.
Electr. Notes Theor. Comput. Sci., 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

Dynamic Hierarchical Machines.
Fundam. Inform., 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. 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

An Axiomatic Semantics for the Synchronous Language Gentzen.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

Concurrency in Timed Automata.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 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. Inform., 1999

On The Expressiveness of Timed Concurrent Constraint Programming.
Electr. Notes Theor. Comput. Sci., 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.
Electr. Notes Theor. Comput. Sci., 1998

Projectable Semantics for Statecharts.
Electr. Notes Theor. Comput. Sci., 1998

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


  Loading...