Robustness Analysis of String Transducers

Samanta, Roopsha; Deshmukh, Jyotirmoy V.; Chaudhuri, Swarat

doi:10.1007/978-3-319-02444-8_30

Cited by 9 publications

(11 citation statements)

References 19 publications

(21 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We present the first study of robustness of systems that are both timed as well as reactive (I/O). We formalize robustness of timed I/O systems as Lipschitz continuity [17,12]. A function is Lipschitz-continuous if its output changes proportionally to every change in the input.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Lipschitz Robustness of Timed I/O Systems

Henzinger

Otop

Samanta

2015

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

We present the first study of robustness of systems that are both timed as well as reactive (I/O). We study the behavior of such timed I/O systems in the presence of uncertain inputs and formalize their robustness using the analytic notion of Lipschitz continuity. Thus, a timed I/O system is K-(Lipschitz) robust if the perturbation in its output is at most K times the perturbation in its input. We quantify input and output perturbation using similarity functions over timed words such as the timed version of the Manhattan distance and the Skorokhod distance. We consider two models of timed I/O systems -timed transducers and asynchronous sequential circuits. While K-robustness is undecidable even for discrete transducers, we identify a class of timed transducers which admits a polynomial space decision procedure for K-robustness. For asynchronous sequential circuits, we reduce K-robustness w.r.t. timed Manhattan distances to K-robusness of discrete letter-to-letter transducers and show PSpace-compeleteness of the problem. Proposition 6. Deciding timed functionality of a timed transducer is PSpacecomplete.Proof. Containment in PSpace: We construct a timed automaton A as T × T ′ × A = , where

show abstract

Section: Introductionmentioning

confidence: 99%

“…Related work. Robustness of systems has been studied in different contexts such as robust control [13], timed automata [9], discrete transducers [17,12] and sequential circuits [8]. However, none of these results are directly applicable to robustness of timed I/O systems.…”

Section: Introductionmentioning

confidence: 99%

Lipschitz Robustness of Timed I/O Systems

Henzinger

Otop

Samanta

2015

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Transducers are popular models of input-output computational systems operating in the real world [13,19,3,23]. While many decision problems about transducers have been studied thoroughly over the decades [19,23], their behaviour under uncertain inputs has only been considered recently [21]. In [21], a transducer was defined to be robust if its output changed proportionally to every change in the input upto a certain threshold.…”

Section: Introductionmentioning

confidence: 99%

Lipschitz Robustness of Finite-state Transducers

Henzinger,

Otop,

Samanta

2014

Preprint

Self Cite

View full text Add to dashboard Cite

We investigate the problem of checking if a finite-state transducer is robust to uncertainty in its input. Our notion of robustness is based on the analytic notion of Lipschitz continuity -a transducer is K-(Lipschitz) robust if the perturbation in its output is at most K times the perturbation in its input. We quantify input and output perturbation using similarity functions. We show that K-robustness is undecidable even for deterministic transducers. We identify a class of functional transducers, which admits a polynomial time automata-theoretic decision procedure for K-robustness. This class includes Mealy machines and functional letter-to-letter transducers. We also study K-robustness of nondeterministic transducers. Since a nondeterministic transducer generates a set of output words for each input word, we quantify output perturbation using set-similarity functions. We show that K-robustness of nondeterministic transducers is undecidable, even for letter-to-letter transducers. We identify a class of set-similarity functions which admit decidable K-robustness of letter-to-letter transducers.

show abstract

“…The weighted Hamming and edit distances between behaviors are also proposed in [36], where the authors use it to develop procedures for reasoning about the Lipshitz-robustness of Mealy machines and string transducers. The notion of robustness is different from ours, and in contrast to our work it is not computed against a specification.…”

Section: Related Workmentioning

confidence: 99%

“…Inspired by [30,36], we propose the weighted edit distance as the measure for comparing the similarity of two discrete signals. It adopts the insertion and deletion operations from the edit distance and adapts the substitution operation to the ordered alphabets.…”

Section: Weighted Edit Distancementioning

confidence: 99%

Quantitative monitoring of STL with edit distance

Jakšić

Bartocci

Grosu

et al. 2018

Form Methods Syst Des

View full text Add to dashboard Cite

In cyber-physical systems (CPS), physical behaviors are typically controlled by digital hardware. As a consequence, continuous behaviors are discretized by sampling and quantization prior to their processing. Quantifying the similarity between CPS behaviors and their specification is an important ingredient in evaluating correctness and quality of such systems. We propose a novel procedure for measuring robustness between digitized CPS signals and signal temporal logic (STL) specifications. We first equip STL with quantitative semantics based on the weighted edit distance, a metric that quantifies both space and time mismatches between digitized CPS behaviors. We then develop a dynamic programming algorithm for computing the robustness degree between digitized signals and STL specifications. In order to promote hardware-based monitors we implemented our approach in FPGA. We evaluated it on automotive benchmarks defined by research community, and also on realistic data obtained from magnetic sensor used in modern cars.

show abstract

Robustness Analysis of String Transducers

Cited by 9 publications

References 19 publications

Lipschitz Robustness of Timed I/O Systems

Lipschitz Robustness of Timed I/O Systems

Lipschitz Robustness of Finite-state Transducers

Quantitative monitoring of STL with edit distance

Contact Info

Product

Resources

About