The following pages link to Valentina Castiglioni (Q783680):
Displayed 17 items.
- Raiders of the lost equivalence: probabilistic branching bisimilarity (Q783681) (← links)
- The metric linear-time branching-time spectrum on nondeterministic probabilistic processes (Q1989321) (← links)
- Probabilistic divide \& congruence: branching bisimilarity (Q2007735) (← links)
- How adaptive and reliable is your program? (Q2117013) (← links)
- On the axiomatisability of priority. III: Priority strikes again (Q2193294) (← links)
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems (Q2272986) (← links)
- A Function Elimination Method for Checking Satisfiability of Arithmetical Logics (Q2968852) (← links)
- (Q3384913) (← links)
- (Q4580323) (← links)
- Modal Decomposition on Nondeterministic Probabilistic Processes (Q4608689) (← links)
- (Q5028469) (← links)
- Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? (Q5056368) (← links)
- (Q5089283) (← links)
- A Specification Format for Rooted Branching Bisimulation (Q5259297) (← links)
- A framework to measure the robustness of programs in the unpredictable environment (Q6135769) (← links)
- Back to the format: a survey on SOS for probabilistic processes (Q6151619) (← links)
- Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction (Q6163879) (← links)