@inproceedings{10774a53403f4a87b4c13687e7c4ddf3,

title = "Computing behavioral distances, compositionally",

abstract = "We propose a general definition of composition operator on Markov Decision Processes with rewards (MDPs) and identify a well behaved class of operators, called safe, that are guaranteed to be non-extensive w.r.t. the bisimilarity pseudometrics of Ferns et al. [10], which measure behavioral similarities between MDPs. For MDPs built using safe/non-extensive operators, we present the first method that exploits the structure of the system for (exactly) computing the bisimilarity distance on MDPs. Experimental results show significant improvements upon the non-compositional technique.",

keywords = "discount factor, multi-agent system, composition operator, Markov decision processes, parallel composition",

author = "Giorgio Bacci and Giovanni Bacci and Larsen, {Kim G.} and Radu Mardare",

year = "2013",

month = oct,

day = "15",

doi = "10.1007/978-3-642-40313-2_9",

language = "English",

isbn = "9783642403125",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "74--85",

editor = "K. Chatterjee and J. Sgall",

booktitle = "Mathematical Foundations of Computer Science 2013",

note = "38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013 ; Conference date: 26-08-2013 Through 30-08-2013",

}