Nondeterministic Streaming String Transducers

Alur, Rajeev; Deshmukh, Jyotirmoy V.

doi:10.1007/978-3-642-22012-8_1

Cited by 31 publications

(46 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The expressive power of functional NSSTs is same as that of DSSTs [4]. As a consequence, our results also imply that the above classes of protocols can be modeled directly as DSSTs.…”

Section: Bounded Non-determinism In Message Corruptionmentioning

confidence: 50%

“…In this work, we propose to use non-deterministic streaming string transducers or NSSTs [4] for modeling the sender. NSSTs are closed under sequential composition (required to compute the protocol transducer) but equivalence checking for NSSTs is undecidable.…”

Section: Our Approachmentioning

confidence: 99%

“…NSSTs are closed under sequential composition (required to compute the protocol transducer) but equivalence checking for NSSTs is undecidable. For a sub-class of NSSTs, called functional NSSTs [4], equivalence checking is pspace-complete. We observe that the receiver transducer is deterministic due to the protocol semantics.…”

Section: Our Approachmentioning

confidence: 99%

See 2 more Smart Citations

Non-deterministic transducer models of retransmission protocols over noisy channels

Thakkar

Kanade

2015

Information Processing Letters

View full text Add to dashboard Cite

“…The expressive power of functional NSSTs is same as that of DSSTs [4]. As a consequence, our results also imply that the above classes of protocols can be modeled directly as DSSTs.…”

Section: Bounded Non-determinism In Message Corruptionmentioning

confidence: 50%

Section: Our Approachmentioning

confidence: 99%

See 1 more Smart Citation

Non-deterministic transducer models of retransmission protocols over noisy channels

Thakkar

Kanade

2015

Information Processing Letters

View full text Add to dashboard Cite

“…NSSTs are closed under sequential composition, but the equivalence problem for them is undecidable [7]. However, there is a subclass of NSSTs, called functional NSSTs, whose equivalence checking problem is decidable.…”

Section: Fig 4 Verification Approachmentioning

confidence: 99%

Transducer-Based Algorithmic Verification of Retransmission Protocols over Noisy Channels

Thakkar

Kanade

Alur

2013

Formal Techniques for Distributed Systems

Self Cite

View full text Add to dashboard Cite

Abstract. Unreliable communication channels are a practical reality. They add to the complexity of protocol design and verification. In this paper, we consider noisy channels which can corrupt messages. We present an approach to model and verify protocols which combine error detection and error control to provide reliable communication over noisy channels. We call these protocols retransmission protocols as they achieve reliable communication through repeated retransmissions of messages. These protocols typically use cyclic redundancy checks and sliding window protocols for error detection and control respectively. We propose models of these protocols as regular transducers operating on bit strings. Streaming string transducers provide a natural way of modeling these protocols and formalizing correctness requirements. The verification problem is posed as functional equivalence between the protocol transducer and the specification transducer. Functional equivalence checking is decidable for this class of transducers and this makes the transducer models amenable to algorithmic verification. We present case studies based on TinyOS serial communication and the HDLC retransmission protocol.

show abstract

“…The construction generalizes the one for NSST on finite strings [19]. However, as runs on finite strings and on infinite strings, we need to make sure that there exist infinite continuations of strings evaluated by that are consistent with .…”

Section: Proof (Sketch)mentioning

confidence: 99%

Regular Transformations of Infinite Strings

Alur

Filiot

Trivedi

2012

2012 27th Annual IEEE Symposium on Logic in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract-The theory of regular transformations of finite strings is quite mature with appealing properties. This class can be equivalently defined using both logic (Monadic secondorder logic) and finite-state machines (two-way transducers, and more recently, streaming string transducers); is closed under operations such as sequential composition and regular choice; and problems such as functional equivalence and type checking, are decidable for this class. In this paper, we initiate a study of transformations of infinite strings. The MSO-based definition for regular string transformations generalizes naturally to infinite strings. We define an equivalent generalization of the machine model of streaming string transducers to infinite strings. A streaming string transducer is a deterministic machine that makes a single pass over the input string, and computes the output fragments using a finite set of string variables that are updated in a copyless manner at each step. We show how Muller acceptance condition for automata over infinite strings can be generalized to associate an infinite output string with an infinite execution. The proof that our model captures all MSO-definable transformations uses two-way transducers. Unlike the case of finite strings, MSO-equivalent definition of two-way transducers over infinite strings needs to make decisions based on omegaregular look-ahead. Simulating this look-ahead using multiple variables with copyless updates, is the main technical challenge in our constructions. Finally, we show that type checking and functional equivalence are decidable for MSO-definable transformations of infinite strings.

show abstract

Nondeterministic Streaming String Transducers

Cited by 31 publications

References 17 publications

Non-deterministic transducer models of retransmission protocols over noisy channels

Non-deterministic transducer models of retransmission protocols over noisy channels

Transducer-Based Algorithmic Verification of Retransmission Protocols over Noisy Channels

Regular Transformations of Infinite Strings

Contact Info

Product

Resources

About