scientific article; zbMATH DE number 7559473

DOI10.4230/LIPICS.CONCUR.2020.17MaRDI QIDQ5089282FDOQ5089282

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

Publication date: 18 July 2022

Title of this publication is not available (Why is that?)

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 theory of timed automata
• Visibly pushdown languages
• Handbook of weighted automata
• A characterization of the minimum cycle mean in a digraph
• Encyclopedia of Distances
• The algorithmic analysis of hybrid systems
• Robustness of temporal logic specifications for continuous-time signals
• Reachability analysis of pushdown automata: Application to model-checking
• Expressiveness and closure properties for quantitative languages
• What's decidable about weighted automata?
• Quantitative languages
• Continuous valuations of temporal logic specifications with applications to parameter optimization and robustness measures
• Robust satisfaction of temporal logic over real-valued signals
• Handbook of Model Checking
• Time robustness in MTL and expressivity in hybrid system falsification
• Quantifying conformance using the Skorokhod metric
• On the Complexity of Shortest Path Problems on Discounted Cost Graphs
• Lipschitz Robustness of Finite-state Transducers
• Robustness Analysis of String Transducers

Cited In (3)

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

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)