Följ
Valentina Castiglioni
Valentina Castiglioni
Verifierad e-postadress på ru.is - Startsida
Titel
Citeras av
Citeras av
År
Logical Characterization of Bisimulation Metrics
V Castiglioni, D Gebler, S Tini
QAPL 2016 227, 44--62, 2016
242016
Modal Decomposition on Nondeterministic Probabilistic Processes
V Castiglioni, D Gebler, S Tini
CONCUR 2016, 36:1-36:15, 2016
122016
The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
V Castiglioni, M Loreti, S Tini
Theoretical Computer Science 813, 20-69, 2020
112020
A Logical Characterization of Differential Privacy via Behavioral Metrics
V Castiglioni, K Chatzikokolakis, C Palamidessi
International Conference on Formal Aspects of Component Software, 75-96, 2018
112018
Trace and Testing Metrics on Nondeterministic Probabilistic Processes
V Castiglioni
arXiv preprint arXiv:1808.08649, 2018
112018
Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition?
L Aceto, V Castiglioni, W Fokkink, A Igolfsdottir, B Luttik
arXiv preprint arXiv:2010.01943, 2020
102020
On the Axiomatisability of Parallel Composition: A Journey in the Spectrum
L Aceto, V Castiglioni, A Ingķlfsdķttir, B Luttik, MR Pedersen
31st International Conference on Concurrency Theory (CONCUR 2020), 2020
102020
Logical Characterization of Trace Metrics
V Castiglioni, S Tini
Quantitative Aspects of Programming Languages and Systems 2017, 36, 2017
72017
A logical characterization of differential privacy
V Castiglioni, K Chatzikokolakis, C Palamidessi
Science of Computer Programming 188, 102388, 2020
52020
Probabilistic divide & congruence: Branching bisimilarity
V Castiglioni, S Tini
Theoretical Computer Science 802, 147-196, 2020
52020
Logical characterization of branching metrics for nondeterministic probabilistic transition systems
V Castiglioni, S Tini
Information and Computation 268, 104432, 2019
52019
SOS-based Modal Decomposition on Nondeterministic Probabilistic Processes
V Castiglioni, D Gebler, S Tini
Logical Methods in Computer Science 14, 2018
52018
Raiders of the lost equivalence: Probabilistic branching bisimilarity
V Castiglioni, S Tini
Information Processing Letters 159, 105947, 2020
42020
In search of lost time: Axiomatising parallel composition in process algebras
L Aceto, E Anastasiadi, V Castiglioni, A Ingķlfsdķttir, B Luttik
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-14, 2021
32021
Measuring Adaptability and Reliability of Large Scale Systems
V Castiglioni, M Loreti, S Tini
International Symposium on Leveraging Applications of Formal Methods, 380-396, 2020
32020
On the axiomatisability of priority III: Priority strikes again
L Aceto, E Anastasiadi, V Castiglioni, A Ingķlfsdķttir, B Luttik, ...
Theoretical Computer Science 837, 223-246, 2020
22020
Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics
V Castiglioni, R Lanotte, S Tini
The Art of Modelling Computational Systems: A Journey from Logic and …, 2019
22019
On the axiomatizability of priority III: The return of sequential composition⋆
L Aceto, E Anastasiadi, V Castiglioni, A Ingķlfsdķttir, MR Pedersen
ICTCS 2019, 2019
22019
A Specification Format for Rooted Branching Bisimulation
V Castiglioni, R Lanotte, S Tini
Fundamenta Informaticae 135 (4), 355-369, 2014
22014
On the Axiomatisability of Parallel Composition
L Aceto, V Castiglioni, A Ingolfsdottir, B Luttik, MR Pedersen
arXiv preprint arXiv:2102.11166, 2021
12021
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20