1 research outputs found

    Computing Bisimilarity Metrics for Probabilistic Timed Automata

    No full text
    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
    corecore