default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimone Tini
Person information
- affiliation: University of Insubria, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j43]Valentina Castiglioni
, Ruggero Lanotte, Simone Tini:
Back to the format: A survey on SOS for probabilistic processes. J. Log. Algebraic Methods Program. 137: 100929 (2024)- [j42]Valentina Castiglioni, Michele Loreti, Simone Tini:
Stark: A tool for the analysis of CPSs robustness. Sci. Comput. Program. 236: 103134 (2024) - [c48]Valentina Castiglioni, Michele Loreti, Simone Tini:
Bio-Stark: A Tool for the Time-Point Robustness Analysis of Biological Systems. CMSB 2024: 62-70 - [c47]Valentina Castiglioni, Michele Loreti, Simone Tini:
RobTL: Robustness Temporal Logic for CPS. CONCUR 2024: 15:1-15:23 - [c46]Valentina Castiglioni, Ruggero Lanotte, Michele Loreti, Simone Tini:
Evaluating the Effectiveness of Digital Twins Through Statistical Model Checking with Feedback and Perturbations. FMICS 2024: 21-39 - [i8]Jian Xiang, Ruggero Lanotte, Simone Tini, Stephen Chong, Massimo Merro:
Measuring Robustness in Cyber-Physical Systems under Sensor Attacks. CoRR abs/2403.05829 (2024) - 2023
- [j41]Valentina Castiglioni, Michele Loreti, Simone Tini:
A framework to measure the robustness of programs in the unpredictable environment. Log. Methods Comput. Sci. 19(3) (2023) - [c45]Valentina Castiglioni, Michele Loreti, Simone Tini:
Stark: A Software Tool for the Analysis of Robustness in the unKnown Environment. COORDINATION 2023: 115-132 - [c44]Stephen Chong, Ruggero Lanotte, Massimo Merro, Simone Tini, Jian Xiang:
Quantitative Robustness Analysis of Sensor Attacks on Cyber-Physical Systems. HSCC 2023: 20:1-20:12 - [c43]Valentina Castiglioni, Michele Loreti, Simone Tini:
DisTL: A Temporal Logic for the Analysis of the Expected Behaviour of Cyber-Physical Systems. ICTCS 2023: 15-30 - [c42]Ruggero Lanotte, Desiree Manicardi, Simone Tini:
Step-by-step Robustness for Biochemical Networks. ICTCS 2023: 299-313 - 2022
- [i7]Valentina Castiglioni, Michele Loreti, Simone Tini:
EvTL: A Temporal Logic for the Transient Analysis of Cyber-Physical Systems. CoRR abs/2204.13357 (2022) - [i6]Valentina Castiglioni, Michele Loreti, Simone Tini:
RobTL: A Temporal Logic for the Robustness of Cyber-Physical Systems. CoRR abs/2212.11158 (2022) - 2021
- [j40]Ruggero Lanotte, Massimo Merro, Simone Tini:
A probabilistic calculus of cyber-physical systems. Inf. Comput. 279: 104618 (2021) - [j39]Jorge A. Pérez, Simone Tini:
Preface to Special Issue: EXPRESS/SOS 2018. Inf. Comput. 281: 104670 (2021) - [j38]Alessandra Cherubini, Nicoletta Sabadini, Simone Tini:
Theoretical Computer Science in Italy. Theor. Comput. Sci. 864: 138 (2021) - [j37]Ruggero Lanotte, Simone Tini:
A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces. Theor. Comput. Sci. 869: 29-61 (2021) - [c41]Ruggero Lanotte, Massimo Merro, Andrei Munteanu, Simone Tini:
Formal Impact Metrics for Cyber-physical Attacks. CSF 2021: 1-16 - [c40]Valentina Castiglioni, Michele Loreti, Simone Tini:
How Adaptive and Reliable is Your Program? FORTE 2021: 60-79 - [i5]Valentina Castiglioni, Michele Loreti, Simone Tini:
A framework to measure the robustness of programs in the unpredictable environment. CoRR abs/2111.15319 (2021) - 2020
- [j36]Kirstin Peters, Simone Tini:
Preface to special issue: EXPRESS/SOS 2016 + 2017. Acta Informatica 57(6): 759-760 (2020) - [j35]Alessandro Gianola, Stefano Kasangian, Desiree Manicardi, Nicoletta Sabadini, Filippo Schiavio, Simone Tini:
CospanSpan(Graph): a Compositional Description of the Heart System. Fundam. Informaticae 171(1-4): 221-237 (2020) - [j34]Valentina Castiglioni, Simone Tini:
Raiders of the lost equivalence: Probabilistic branching bisimilarity. Inf. Process. Lett. 159-160: 105947 (2020) - [j33]Valentina Castiglioni, Simone Tini:
Probabilistic divide & congruence: Branching bisimilarity. Theor. Comput. Sci. 802: 147-196 (2020) - [j32]Valentina Castiglioni, Michele Loreti, Simone Tini:
The metric linear-time branching-time spectrum on nondeterministic probabilistic processes. Theor. Comput. Sci. 813: 20-69 (2020) - [c39]Alessandro Gianola, Stefano Kasangian, Desiree Manicardi, Nicoletta Sabadini, Simone Tini:
Compositional Modeling of Biological Systems in CospanSpan(Graph). ICTCS 2020: 61-66 - [c38]Valentina Castiglioni, Michele Loreti, Simone Tini:
Measuring Adaptability and Reliability of Large Scale Systems. ISoLA (2) 2020: 380-396
2010 – 2019
- 2019
- [j31]Valentina Castiglioni, Simone Tini:
Logical characterization of branching metrics for nondeterministic probabilistic transition systems. Inf. Comput. 268 (2019) - [c37]Valentina Castiglioni, Ruggero Lanotte, Simone Tini:
Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics. The Art of Modelling Computational Systems 2019: 293-312 - [c36]Ruggero Lanotte, Simone Tini:
Computing Bisimilarity Metrics for Probabilistic Timed Automata. IFM 2019: 303-321 - [e3]Alessandra Cherubini, Nicoletta Sabadini, Simone Tini:
Proceedings of the 20th Italian Conference on Theoretical Computer Science, ICTCS 2019, Como, Italy, September 9-11, 2019. CEUR Workshop Proceedings 2504, CEUR-WS.org 2019 [contents] - 2018
- [j30]Daniel Gebler, Simone Tini:
SOS specifications for uniformly continuous operators. J. Comput. Syst. Sci. 92: 113-151 (2018) - [j29]Valentina Castiglioni, Daniel Gebler, Simone Tini:
SOS-based Modal Decomposition on Nondeterministic Probabilistic Processes. Log. Methods Comput. Sci. 14(2) (2018) - [j28]Ruggero Lanotte, Massimo Merro, Simone Tini:
Equational Reasonings in Wireless Network Gossip Protocols. Log. Methods Comput. Sci. 14(3) (2018) - [c35]Ruggero Lanotte, Simone Tini:
Weak Bisimulation Metrics in Models with Nondeterminism and Continuous State Spaces. ICTAC 2018: 292-312 - [c34]Ruggero Lanotte, Massimo Merro, Simone Tini:
Towards a Formal Notion of Impact Metric for Cyber-Physical Attacks. IFM 2018: 296-315 - [e2]Jorge A. Pérez, Simone Tini:
Proceedings Combined 25th International Workshop on Expressiveness in Concurrency and 15th Workshop on Structural Operational Semantics, EXPRESS/SOS 2018, Beijing, China, September 3, 2018. EPTCS 276, 2018 [contents] - [i4]Ruggero Lanotte, Massimo Merro, Simone Tini:
Towards a formal notion of impact metric for cyber-physical attacks (full version). CoRR abs/1806.10463 (2018) - 2017
- [c33]Ruggero Lanotte, Massimo Merro, Simone Tini:
Weak Simulation Quasimetric in a Gossip Scenario. FORTE 2017: 139-155 - [c32]Ruggero Lanotte, Massimo Merro, Simone Tini:
Compositional Weak Metrics for Group Key Update. MFCS 2017: 72:1-72:16 - [c31]Valentina Castiglioni, Simone Tini:
Logical Characterization of Trace Metrics. QAPL@ETAPS 2017: 39-74 - [e1]Kirstin Peters, Simone Tini:
Proceedings Combined 24th International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics, EXPRESS/SOS 2017, Berlin, Germany, 4th September 2017. EPTCS 255, 2017 [contents] - [i3]Valentina Castiglioni, Daniel Gebler, Simone Tini:
SOS-based Modal Decomposition on Nondeterministic Probabilistic Processes. CoRR abs/1701.08330 (2017) - [i2]Ruggero Lanotte, Massimo Merro, Simone Tini:
A Probabilistic Calculus of Cyber-Physical Systems. CoRR abs/1707.02279 (2017) - [i1]Ruggero Lanotte, Massimo Merro, Simone Tini:
Equational Reasonings in Wireless Network Gossip Protocols. CoRR abs/1707.03215 (2017) - 2016
- [j27]Daniel Gebler, Kim G. Larsen, Simone Tini:
Compositional bisimulation metric reasoning with Probabilistic Process Calculi. Log. Methods Comput. Sci. 12(4) (2016) - [j26]Valentina Castiglioni, Ruggero Lanotte, Simone Tini:
A Function Elimination Method for Checking Satisfiability of Arithmetical Logics. Fundam. Informaticae 143(1-2): 51-71 (2016) - [c30]Valentina Castiglioni, Daniel Gebler, Simone Tini:
Modal Decomposition on Nondeterministic Probabilistic Processes. CONCUR 2016: 36:1-36:15 - [c29]Ruggero Lanotte, Simone Tini:
Extending Taylor Approximation to Hybrid Systems with Integrals. CS&P 2016: 141-152 - [c28]Valentina Castiglioni, Daniel Gebler, Simone Tini:
Logical Characterization of Bisimulation Metrics. QAPL 2016: 44-62 - 2015
- [c27]Daniel Gebler, Simone Tini:
SOS Specifications of Probabilistic Systems by Uniformly Continuous Operators. CONCUR 2015: 155-168 - [c26]Daniel Gebler, Kim Guldstrand Larsen, Simone Tini:
Compositional Metric Reasoning with Probabilistic Process Calculi. FoSSaCS 2015: 230-245 - 2014
- [j25]Valentina Castiglioni, Ruggero Lanotte, Simone Tini:
A Specification Format for Rooted Branching Bisimulation. Fundam. Informaticae 135(4): 355-369 (2014) - [j24]Giovanni Pardini, Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Simone Tini:
Compositional semantics and behavioural equivalences for reaction systems with restriction. Theor. Comput. Sci. 551: 1-21 (2014) - [c25]Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Giovanni Pardini, Simone Tini:
Systolic Automata and P Systems. Computing with New Resources 2014: 17-31 - [c24]Valentina Castiglioni, Ruggero Lanotte, Simone Tini:
A Function Elimination Method for Checking Satisfiability of Arithmetical Logics. CS&P 2014: 46-57 - [c23]Daniel Gebler, Simone Tini:
Fixed-point Characterization of Compositionality Properties of Probabilistic Processes Combinators. EXPRESS/SOS 2014: 63-78 - 2013
- [c22]Giovanni Pardini, Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Simone Tini:
A Compositional Semantics of Reaction Systems with Restriction. CiE 2013: 330-339 - [c21]Valentina Castiglioni, Ruggero Lanotte, Simone Tini:
A Rule Format for Rooted Branching Bisimulation. CS&P 2013: 49-60 - [c20]Daniel Gebler, Simone Tini:
Compositionality of Approximate Bisimulation for Probabilistic Systems. EXPRESS/SOS 2013: 32-46 - 2012
- [j23]Roberto Barbuti, Giulio Caravagna, Andrea Maggiolo-Schettini, Paolo Milazzo, Simone Tini:
Foundational aspects of multiscale modeling of biological systems with process algebras. Theor. Comput. Sci. 431: 96-116 (2012) - 2011
- [j22]Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Simone Tini:
An Overview on Operational Semantics in Membrane Computing. Int. J. Found. Comput. Sci. 22(1): 119-131 (2011) - 2010
- [j21]Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Simone Tini:
Compositional semantics of spiking neural P systems. J. Log. Algebraic Methods Program. 79(6): 304-316 (2010) - [j20]Simone Tini:
Non-expansive epsilon-bisimulations for probabilistic processes. Theor. Comput. Sci. 411(22-24): 2202-2222 (2010) - [c19]Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Simone Tini:
Membrane Systems Working in Generating and Accepting Modes: Expressiveness and Encodings. Int. Conf. on Membrane Computing 2010: 103-118 - [c18]Roberto Barbuti, Giulio Caravagna, Paolo Milazzo, Andrea Maggiolo-Schettini, Simone Tini:
Aspects of multiscale modelling in a process algebra for biological systems. MeCBIC 2010: 54-69
2000 – 2009
- 2009
- [j19]Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Simone Tini:
P Systems with Transport and Diffusion Membrane Channels. Fundam. Informaticae 93(1-3): 17-31 (2009) - [j18]Ruggero Lanotte, Simone Tini:
Probabilistic bisimulation as a congruence. ACM Trans. Comput. Log. 10(2): 9:1-9:48 (2009) - 2008
- [j17]Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Simone Tini:
A P Systems Flat Form Preserving Step-by-step Behaviour. Fundam. Informaticae 87(1): 1-34 (2008) - [j16]Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Simone Tini:
Compositional semantics and behavioral equivalences for P Systems. Theor. Comput. Sci. 395(1): 77-100 (2008) - [c17]Simone Tini:
Non Expansive epsilon-Bisimulations. AMAST 2008: 362-376 - 2007
- [j15]Ruggero Lanotte, Simone Tini:
Taylor approximation for hybrid systems. Inf. Comput. 205(11): 1575-1607 (2007) - 2006
- [c16]Simone Tini:
Notes on Generative Probabilistic Bisimulation. SOS@CONCUR 2006: 77-88 - 2005
- [c15]Ruggero Lanotte, Simone Tini:
Probabilistic Congruence for Semistochastic Generative Processes. FoSSaCS 2005: 63-78 - [c14]Ruggero Lanotte, Simone Tini:
Taylor Approximation for Hybrid Systems. HSCC 2005: 402-416 - 2004
- [j14]Simone Tini:
Timed CCP compositionally embeds Argos and Lustre. Formal Aspects Comput. 16(3): 292-312 (2004) - [j13]Simone Tini, Andrea Maggiolo-Schettini:
Compositional Synthesis of Generalized Mealy Machines. Fundam. Informaticae 60(1-4): 367-382 (2004) - [j12]Roberto Gorrieri, Ruggero Lanotte, Andrea Maggiolo-Schettini, Fabio Martinelli, Simone Tini, Enrico Tronci:
Automated analysis of timed security: a case study on web privacy. Int. J. Inf. Sec. 2(3-4): 168-186 (2004) - [j11]Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini:
Epsilon-transitions in Concurrent Timed Automata. Inf. Process. Lett. 89(1): 1-7 (2004) - [j10]Simone Tini:
Rule formats for compositional non-interference properties. J. Log. Algebraic Methods Program. 60-61: 353-400 (2004) - [j9]Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini:
Information flow in hybrid systems. ACM Trans. Embed. Comput. Syst. 3(4): 760-799 (2004) - [c13]Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini, Angelo Troina, Enrico Tronci:
Automatic Covert Channel Analysis of a Multilevel Secure Component. ICICS 2004: 249-261 - 2003
- [j8]Ruggero Lanotte, Andrea Maggiolo-Schettini, Adriano Peron, Simone Tini:
Dynamic Hierarchical Machines. Fundam. Informaticae 54(2-3): 237-252 (2003) - [j7]Simone Tini:
An axiomatic semantics for the synchronous language Gentzen. J. Comput. Syst. Sci. 66(2): 316-348 (2003) - [j6]Andrea Maggiolo-Schettini, Adriano Peron, Simone Tini:
A comparison of Statecharts step semantics. Theor. Comput. Sci. 290(1): 465-498 (2003) - [j5]Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini:
Concurrency in timed automata. Theor. Comput. Sci. 309(1-3): 503-527 (2003) - [c12]Simone Tini:
Rule Formats for Non Interference. ESOP 2003: 129-143 - [c11]Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini, Angelo Troina, Enrico Tronci:
Automatic Analysis of the NRL Pump. MEFISTO 2003: 245-266 - 2002
- [j4]Andrea Maggiolo-Schettini, Simone Tini:
On disjunction of literals in triggers of statecharts transitions. Inf. Process. Lett. 84(6): 305-310 (2002) - 2001
- [j3]Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini, Adriano Peron:
Transformations of Timed Cooperating Automata. Fundam. Informaticae 47(3-4): 271-282 (2001) - [j2]Simone Tini:
An axiomatic semantics for Esterel. Theor. Comput. Sci. 269(1-2): 231-282 (2001) - [c10]Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini:
Concurrency in Timed Automata. FCT 2001: 240-251 - [c9]Simone Tini:
An Axiomatic Semantics for the Synchronous Language Gentzen. FoSSaCS 2001: 394-409 - [c8]Riccardo Focardi, Roberto Gorrieri, Ruggero Lanotte, Andrea Maggiolo-Schettini, Fabio Martinelli, Simone Tini, Enrico Tronci:
Formal Models of Timing Attacks on Web Privacy. TOSCA 2001: 229-243 - [c7]Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini:
Privacy in Real-Time Systems. MTCS 2001: 295-305 - 2000
- [c6]Simone Tini, Andrea Maggiolo-Schettini:
A Causal Semantics for Timed Default Concurrent Constraint Programming. AMAST 2000: 228-242
1990 – 1999
- 1999
- [j1]Andrea Maggiolo-Schettini, Simone Tini:
Applying Techniques of Asynchronous Concurrency to Synchronous Languages. Fundam. Informaticae 40(2-3): 221-250 (1999) - [c5]Simone Tini, Andrea Maggiolo-Schettini:
A Truly Concurrent Semantics for Timed Default Concurrent Constraint Programming. ECOOP Workshops 1999: 256-258 - [c4]Simone Tini:
On The Expressiveness of Timed Concurrent Constraint Programming. EXPRESS 1999: 3-17 - 1998
- [c3]Simone Tini, Andrea Maggiolo-Schettini:
Two semantics for Timed Default Concurrent Constraint Programming. COTIC 1998: 24-41 - [c2]Andrea Maggiolo-Schettini, Simone Tini:
Projectable Semantics for Statecharts. MFCS Workshop on Concurrency 1998: 134-146 - 1996
- [c1]Andrea Maggiolo-Schettini, Adriano Peron, Simone Tini:
Equivalences of Statecharts. CONCUR 1996: 687-702
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
