Hoppa till huvudinnehållet

Sök på KTH:s webbplats
English

Using Timed Muller Automata to Verify Refinement of Probabilistic Contracts (With Proofs)

Verifying_Refinement_of_Probabilistic_Contracts_Using_Timed_Automata_(With_Proofs).pdf

Anton Hampus,
DOKTORAND
ahampus@kth.se

Portfolio

Formally Verifying Decompositions of Stochastic Specifications (With Proofs)
Using Timed Muller Automata to Verify Refinement of Probabilistic Contracts (With Proofs)