Distances for weighted transition systems: games and properties

MaRDI QIDQ4965817zbMATH OpenFDO

Authors Uli Fahrenberg, Claus Thrane, Kim G. Larsen

Publication date 10 March 2021

Full work available at URL https://arxiv.org/abs/1107.1205, http://eptcs.web.cse.unsw.edu.au/paper.cgi?QAPL2011.10

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of game theory (91A80)

Recommendations

• Computing branching distances with quantitative games
• Quantitative analysis of weighted transition systems
• Computing branching distances using quantitative games
• Generalized quantitative analysis of metric transition systems
• Automata, Languages and Programming

Cited in

(11)

• Weighted modal transition systems
• Computing branching distances using quantitative games
• The quantitative linear-time-branching-time spectrum
• Distances between processes: a pure algebraic approach
• The quantitative linear-time-branching-time spectrum
• Generalized quantitative analysis of metric transition systems
• Game Refinement Relations and Metrics
• Metrics for weighted transition systems: axiomatization and complexity
• Convex lattice equation systems
• Quantitative aspects of programming languages and systems over the past 2⁴ years and beyond
• Quantitative analysis of weighted transition systems

This page was built for publication: Distances for weighted transition systems: games and properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965817)