Skip to main content
Conference Proceedings

Computing Bisimilarity Metrics for Probabilistic Timed Automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2019) 11918 LNCS 303-321
DOI: 10.1007/978-3-030-34968-4_17
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Lanotte, R., & Tini, S. (2019). Computing Bisimilarity Metrics for Probabilistic Timed Automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11918 LNCS, pp. 303–321). Springer. https://doi.org/10.1007/978-3-030-34968-4_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free