default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDValentina Castiglioni
Person information
- affiliation: Eindhoven University of Technology, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j15]Valentina Castiglioni, Ornela Dardha, Claudio Antares Mezzina:
Preface. Inf. Comput. 302: 105226 (2025)- 2024
- [j14]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) - [j13]Valentina Castiglioni, Michele Loreti, Simone Tini:
Stark: A tool for the analysis of CPSs robustness. Sci. Comput. Program. 236: 103134 (2024) - [c21]Valentina Castiglioni, Michele Loreti, Simone Tini:
Bio-Stark: A Tool for the Time-Point Robustness Analysis of Biological Systems. CMSB 2024: 62-70 - [c20]Valentina Castiglioni, Michele Loreti, Simone Tini:
RobTL: Robustness Temporal Logic for CPS. CONCUR 2024: 15:1-15:23 - [c19]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 - [e3]Valentina Castiglioni, Adrian Francalanza:
Formal Techniques for Distributed Objects, Components, and Systems - 44th IFIP WG 6.1 International Conference, FORTE 2024, Held as Part of the 19th International Federated Conference on Distributed Computing Techniques, DisCoTec 2024, Groningen, The Netherlands, June 17-21, 2024, Proceedings. Lecture Notes in Computer Science 14678, Springer 2024, ISBN 978-3-031-62644-9 [contents] - 2023
- [j12]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) - [c18]Valentina Castiglioni, Michele Loreti, Simone Tini:
Stark: A Software Tool for the Analysis of Robustness in the unKnown Environment. COORDINATION 2023: 115-132 - [c17]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 - 2022
- [j11]Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik, Mathias Ruggaard Pedersen:
On the Axiomatisability of Parallel Composition. Log. Methods Comput. Sci. 18(1) (2022) - [j10]Luca Aceto, Valentina Castiglioni, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ACM Trans. Comput. Log. 23(4): 22:1-22:56 (2022) - [c16]Luca Aceto, Elli Anastasiadi, Valentina Castiglioni, Anna Ingólfsdóttir:
Non-finite Axiomatisability Results via Reductions: CSP Parallel Composition and CCS Restriction. A Journey from Process Algebra via Timed Automata to Model Learning 2022: 1-26 - [c15]Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik:
On the Axiomatisation of Branching Bisimulation Congruence over CCS. CONCUR 2022: 6:1-6:18 - [e2]Valentina Castiglioni, Claudio Antares Mezzina:
Proceedings Combined 29th International Workshop on Expressiveness in Concurrency and 19th Workshop on Structural Operational Semantics, EXPRESS/SOS 2022, Warsaw, Poland, 12th September 2022. EPTCS 368, 2022 [contents] - [i9]Valentina Castiglioni, Michele Loreti, Simone Tini:
EvTL: A Temporal Logic for the Transient Analysis of Cyber-Physical Systems. CoRR abs/2204.13357 (2022) - [i8]Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik:
On the Axiomatisation of Branching Bisimulation Congruence over CCS. CoRR abs/2206.13927 (2022) - [i7]Valentina Castiglioni, Michele Loreti, Simone Tini:
RobTL: A Temporal Logic for the Robustness of Cyber-Physical Systems. CoRR abs/2212.11158 (2022) - 2021
- [c14]Luca Aceto, Valentina Castiglioni, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition? CSL 2021: 8:1-8:17 - [c13]Valentina Castiglioni, Michele Loreti, Simone Tini:
How Adaptive and Reliable is Your Program? FORTE 2021: 60-79 - [c12]Luca Aceto, Elli Anastasiadi, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik:
In search of lost time: Axiomatising parallel composition in process algebras. LICS 2021: 1-14 - [e1]Ornela Dardha, Valentina Castiglioni:
Proceedings Combined 28th International Workshop on Expressiveness in Concurrency and 18th Workshop on Structural Operational Semantics, EXPRESS/SOS 2021, and 18th Workshop on Structural Operational SemanticsParis, France (online event), 23rd August 2021. EPTCS 339, 2021 [contents] - [i6]Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik, Mathias Ruggaard Pedersen:
On the Axiomatisability of Parallel Composition. CoRR abs/2102.11166 (2021) - [i5]Luca Aceto, Elli Anastasiadi, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik:
In search of lost time: Axiomatising parallel composition in process algebras. CoRR abs/2105.00735 (2021) - [i4]Valentina Castiglioni, Michele Loreti, Simone Tini:
A framework to measure the robustness of programs in the unpredictable environment. CoRR abs/2111.15319 (2021) - 2020
- [j9]Valentina Castiglioni, Simone Tini:
Raiders of the lost equivalence: Probabilistic branching bisimilarity. Inf. Process. Lett. 159-160: 105947 (2020) - [j8]Valentina Castiglioni, Konstantinos Chatzikokolakis, Catuscia Palamidessi:
A logical characterization of differential privacy. Sci. Comput. Program. 188: 102388 (2020) - [j7]Valentina Castiglioni, Simone Tini:
Probabilistic divide & congruence: Branching bisimilarity. Theor. Comput. Sci. 802: 147-196 (2020) - [j6]Valentina Castiglioni, Michele Loreti, Simone Tini:
The metric linear-time branching-time spectrum on nondeterministic probabilistic processes. Theor. Comput. Sci. 813: 20-69 (2020) - [j5]Luca Aceto, Elli Anastasiadi, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik, Mathias Ruggaard Pedersen:
On the axiomatisability of priority III: Priority strikes again. Theor. Comput. Sci. 837: 223-246 (2020) - [c11]Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik, Mathias Ruggaard Pedersen:
On the Axiomatisability of Parallel Composition: A Journey in the Spectrum. CONCUR 2020: 18:1-18:22 - [c10]Valentina Castiglioni, Michele Loreti, Simone Tini:
Measuring Adaptability and Reliability of Large Scale Systems. ISoLA (2) 2020: 380-396 - [i3]Luca Aceto, Valentina Castiglioni, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition? CoRR abs/2010.01943 (2020)
2010 – 2019
- 2019
- [j4]Valentina Castiglioni, Simone Tini:
Logical characterization of branching metrics for nondeterministic probabilistic transition systems. Inf. Comput. 268 (2019) - [c9]Valentina Castiglioni, Ruggero Lanotte, Simone Tini:
Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics. The Art of Modelling Computational Systems 2019: 293-312 - [c8]Luca Aceto, Elli Anastasiadi, Valentina Castiglioni, Anna Ingólfsdóttir, Mathias Ruggaard Pedersen:
On the Axiomatizability of Priority III: The Return of Sequential Composition. ICTCS 2019: 145-157 - 2018
- [j3]Valentina Castiglioni, Daniel Gebler, Simone Tini:
SOS-based Modal Decomposition on Nondeterministic Probabilistic Processes. Log. Methods Comput. Sci. 14(2) (2018) - [c7]Valentina Castiglioni, Konstantinos Chatzikokolakis, Catuscia Palamidessi:
A Logical Characterization of Differential Privacy via Behavioral Metrics. FACS 2018: 75-96 - [c6]Valentina Castiglioni:
Trace and Testing Metrics on Nondeterministic Probabilistic Processes. EXPRESS/SOS 2018: 19-36 - 2017
- [b1]Valentina Castiglioni:
Probabilistic Semantics: Metric and Logical Character¨ations for Nondeterministic Probabilistic Processes. University of Insubria, Italy, 2017 - [c5]Valentina Castiglioni, Simone Tini:
Logical Characterization of Trace Metrics. QAPL@ETAPS 2017: 39-74 - [i2]Valentina Castiglioni, Daniel Gebler, Simone Tini:
SOS-based Modal Decomposition on Nondeterministic Probabilistic Processes. CoRR abs/1701.08330 (2017) - 2016
- [j2]Valentina Castiglioni, Ruggero Lanotte, Simone Tini:
A Function Elimination Method for Checking Satisfiability of Arithmetical Logics. Fundam. Informaticae 143(1-2): 51-71 (2016) - [c4]Valentina Castiglioni, Daniel Gebler, Simone Tini:
Modal Decomposition on Nondeterministic Probabilistic Processes. CONCUR 2016: 36:1-36:15 - [c3]Valentina Castiglioni, Daniel Gebler, Simone Tini:
Logical Characterization of Bisimulation Metrics. QAPL 2016: 44-62 - 2015
- [i1]Valentina Castiglioni, Ruggero Lanotte, Massimo Merro:
A Semantic Theory for the Internet of Things. CoRR abs/1510.04854 (2015) - 2014
- [j1]Valentina Castiglioni, Ruggero Lanotte, Simone Tini:
A Specification Format for Rooted Branching Bisimulation. Fundam. Informaticae 135(4): 355-369 (2014) - [c2]Valentina Castiglioni, Ruggero Lanotte, Simone Tini:
A Function Elimination Method for Checking Satisfiability of Arithmetical Logics. CS&P 2014: 46-57 - 2013
- [c1]Valentina Castiglioni, Ruggero Lanotte, Simone Tini:
A Rule Format for Rooted Branching Bisimulation. CS&P 2013: 49-60
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-12-26 00:47 CET 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:
