Discounting the future in systems theory

DOI10.1007/3-540-45061-0_79MaRDI QIDQ4449238zbMATH OpenFDO

Authors Luca De Alfaro, Rupak Majumdar, Thomas A. Henzinger

Publication date 8 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

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

• Discounted duration calculus
• Discounting infinite games but how and why?
• scientific article; zbMATH DE number 939795
• Tools and Algorithms for the Construction and Analysis of Systems
• Discounting in LTL

Cited in

(51)

• Characterize branching distance in terms of ( , )-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
• Trace and testing metrics on nondeterministic probabilistic processes
• Weighted Automata and Weighted Logics with Discounting
• Value Iteration
• Quantitative simulation games
• A Weighted μ-Calculus on Words
• Weighted finite automata over hemirings
• General quantitative specification theories with modal transition systems
• A survey of stochastic -regular games
• Weighted automata and weighted logics
• Compositional weak metrics for group key update
• On values of games
• 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\)
• Quantitative safety and liveness
• On the comparison of discounted-sum automata with multiple discount factors
• 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
• Policy synthesis and reinforcement learning for discounted LTL
• Determinization of integral discounted-sum automata is decidable
• Discounted-sum automata with multiple discount factors
• Discounted-sum automata with multiple discount factors
• Safety and liveness of quantitative automata
• Discounted-sum automata with real-valued discount factors
• Deterministic sub-exponential algorithm for discounted-sum games with unary weights
• Safety and liveness of quantitative properties and automata
• Discounting in time
• Logical characterization of bisimulation metrics
• Concurrent stochastic games with stateful-discounted and parity objectives: complexity and algorithms
• Simulation distances
• Weighted automata and weighted logics with discounting
• Skew and infinitary formal power series

This page was built for publication: Discounting the future in systems theory

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