Publication:4449238

Luca de Alfaro, Rupak Majumdar, Thomas A. Henzinger

Publication date: 8 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27191022.htm

91A80: Applications of game theory

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Weighted Automata and Weighted Logics, On Values of Games, Compositional weak metrics for group key update, Model Checking Quantitative Linear Time Logic, Measuring and Synthesizing Systems in Probabilistic Environments, Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$, Weighted finite automata over hemirings, General quantitative specification theories with modal transition systems, A survey of stochastic $\omega $-regular games, Simulation distances, Weighted automata and weighted logics with discounting, Skew and infinitary formal power series, Characterize branching distance in terms of $(\eta , \alpha )$-bisimilarity, SOS specifications for uniformly continuous operators, Polynomial-time algorithms for computing distances of fuzzy transition systems, Model checking games for the quantitative $\mu $-calculus, The metric linear-time branching-time spectrum on nondeterministic probabilistic processes, Computing branching distances with quantitative games, Weighted modal transition systems, Logical characterization of branching metrics for nondeterministic probabilistic transition systems, Recursively defined metric spaces without contraction, The quantitative linear-time-branching-time spectrum, Approximating and computing behavioural distances in probabilistic transition systems, Model checking discounted temporal properties, Enhancing Automata Learning by Log-Based Metrics, Weighted LTL with Discounting, Compositional bisimulation metric reasoning with Probabilistic Process Calculi, On Memoryless Quantitative Objectives, Timed Automata Can Always Be Made Implementable, Equational Weighted Tree Transformations with Discounting, Unnamed Item, Weighted Automata and Weighted Logics with Discounting, Value Iteration, Quantitative Simulation Games, A Weighted μ-Calculus on Words