Computing branching distances using quantitative games

DOI10.1007/978-3-030-32505-3_4zbMath1464.68238arXiv1910.08943OpenAlexW3092192261MaRDI QIDQ2279111

Axel Legay, Uli Fahrenberg, Karin Quaas

Publication date: 12 December 2019

Full work available at URL: https://arxiv.org/abs/1910.08943

zbMATH Keywords

quantitative verificationbranching distancepath-building gamequantitative game

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Computing branching distances with quantitative games ⋮ Dynamics of reputation in mobile agents systems and weighted timed automata

This page was built for publication: Computing branching distances using quantitative games