scientific article; zbMATH DE number 2038772
From MaRDI portal
Publication:4449238
zbMath1039.68087MaRDI QIDQ4449238
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (40)
Recursively defined metric spaces without contraction ⋮ Weighted automata and weighted logics with discounting ⋮ Weighted LTL with Discounting ⋮ Skew and infinitary formal power series ⋮ Weighted Automata and Weighted Logics ⋮ SOS specifications for uniformly continuous operators ⋮ Weighted finite automata over hemirings ⋮ General quantitative specification theories with modal transition systems ⋮ Weighted Automata and Weighted Logics with Discounting ⋮ Quantitative safety and liveness ⋮ On the comparison of discounted-sum automata with multiple discount factors ⋮ A survey of stochastic \(\omega \)-regular games ⋮ Sound approximate and asymptotic probabilistic bisimulations for PCTL ⋮ A framework to measure the robustness of programs in the unpredictable environment ⋮ Back to the format: a survey on SOS for probabilistic processes ⋮ Value Iteration ⋮ Compositional bisimulation metric reasoning with Probabilistic Process Calculi ⋮ Computing branching distances with quantitative games ⋮ Unnamed Item ⋮ Model checking games for the quantitative \(\mu \)-calculus ⋮ The quantitative linear-time-branching-time spectrum ⋮ The metric linear-time branching-time spectrum on nondeterministic probabilistic processes ⋮ Polynomial-time algorithms for computing distances of fuzzy transition systems ⋮ Weighted modal transition systems ⋮ Model Checking Quantitative Linear Time Logic ⋮ Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$ ⋮ On Values of Games ⋮ Quantitative Simulation Games ⋮ Logical characterization of branching metrics for nondeterministic probabilistic transition systems ⋮ Approximating and computing behavioural distances in probabilistic transition systems ⋮ Characterize branching distance in terms of \((\eta , \alpha )\)-bisimilarity ⋮ Enhancing Automata Learning by Log-Based Metrics ⋮ On Memoryless Quantitative Objectives ⋮ Timed Automata Can Always Be Made Implementable ⋮ A Weighted μ-Calculus on Words ⋮ Equational Weighted Tree Transformations with Discounting ⋮ Simulation distances ⋮ Compositional weak metrics for group key update ⋮ Measuring and Synthesizing Systems in Probabilistic Environments ⋮ Model checking discounted temporal properties
This page was built for publication:
