We are interested in describing timed systems that exhibit probabilistic behaviour and in evaluating their behavioural discrepancies. To this purpose, we consider probabilistic timed automata, we introduce a concept of n-bisimilarity metric and give an algorithm to decide it.
Computing Bisimilarity Metrics for Probabilistic Timed Automata
Lanotte, Ruggero;Tini, Simone
2019-01-01
Abstract
We are interested in describing timed systems that exhibit probabilistic behaviour and in evaluating their behavioural discrepancies. To this purpose, we consider probabilistic timed automata, we introduce a concept of n-bisimilarity metric and give an algorithm to decide it.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
