scientific article; zbMATH DE number 7559473

DOI10.4230/LIPICS.CONCUR.2020.17MaRDI QIDQ5089282FDO

Authors Emmanuel Filiot, Nicolas Mazzocchi, Sriram Sankaranarayanan, Ashutosh Trivedi, Jean-François Raskin

Publication date 18 July 2022

zbMATH Keywords

fault-tolerancequantitative verificationweighted transducers

Mathematics Subject Classification ID

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

Cites work

• A characterization of the minimum cycle mean in a digraph
• A theory of timed automata
• Continuous valuations of temporal logic specifications with applications to parameter optimization and robustness measures
• Encyclopedia of Distances
• Expressiveness and closure properties for quantitative languages
• Handbook of model checking
• Handbook of weighted automata
• Lipschitz robustness of finite-state transducers
• On the complexity of shortest path problems on discounted cost graphs
• Quantifying conformance using the Skorokhod metric
• Quantitative languages
• Reachability analysis of pushdown automata: Application to model-checking
• Robust satisfaction of temporal logic over real-valued signals
• Robustness analysis of string transducers
• Robustness of temporal logic specifications for continuous-time signals
• The algorithmic analysis of hybrid systems
• Time robustness in MTL and expressivity in hybrid system falsification
• Visibly pushdown languages
• What's decidable about weighted automata?

Cited in

(3)

• GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
• On tolerance of discrete systems with respect to transition perturbations
• Optimal repair for omega-regular properties

This page was built for publication:

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