From Stream Transformers to Moore State Transition Machines with Input and Output

Dosch, Walter; Ruanthong, Wuttipong; Stümpel, Annette

doi:10.1109/snpd-sawn.2006.40

Cited by 13 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This approach has been used for implementing several software components [4,6,7]. For the permutable queue, we simply use some internal data structures and a procedural algorithm, and leave the use of a state transition machine as a future research topic.…”

Section: Methodsmentioning

confidence: 99%

See 1 more Smart Citation

Permutable Queue as a 1-in-N-out Message Router

2007

5th ACIS International Conference on Software Engineering Research, Management &Amp; Applications (SERA 2007)

View full text Add to dashboard Cite

The basic queue is a first-in-first-out linear data structure (software component). It can be considered as a communication device with one input port and one output port. In the paper, we investigate the behavior of an extended queue that has one input channel and multiple output channels. An enter-queue command enters a data item into the queue as does an ordinary queue, but a de-queue command removes the front item and sends it to a specific output channel. This is similar to the function of a simplified message router. We define a set of stream functions to map between input stream and output stream to describe the behavior of the queue. Because of the items in the input stream may be re-ordered to meet the "routing" requirements, we call the software component "permutable queue."

show abstract

Section: Methodsmentioning

confidence: 99%

“…In some of these studies, interactive components are often described using stream functions [9]. Dosch and Stümpel [7] discussed using state transition machine for the process from input stream to output stream. An abstract model using this basic approach for an interactive stack was proposed in [4] and for an interactive queue in [6].…”

Section: Related Workmentioning

confidence: 99%

Permutable Queue as a 1-in-N-out Message Router

2007

5th ACIS International Conference on Software Engineering Research, Management &Amp; Applications (SERA 2007)

View full text Add to dashboard Cite

show abstract

“…State transition machines with input and output [7] model state-based components on an abstract level; for more refined state transition systems compare [3,5] , for labelled transition systems [20] .…”

Section: State Transition Machinesmentioning

confidence: 99%

Enriching the Input Interface of Interactive Components with Undo Commands

Dosch

2006

Fourth International Conference on Software Engineering Research, Management and Applications (SERA'06)

Self Cite

View full text Add to dashboard Cite

The paper studies the systematic design and implementation of interactive components whose input interface is enriched by undo commands. An undo command inverts the interaction history returning to a previously visited state. We formalize different policies for undo commands cancelling the most recent input, the most recent occurrence of a specified input, and the final history segment after a user defined checkpoint. For each undo policy, we specify the component's modified input/output behaviour in terms of the original behaviour as a function from input streams to output streams. Then we systematically transform the modified input/output behaviour into an implementation by a state transition machine. The resulting formal method extends the state transition table of an interactive component in a systematic way when its input interface is enriched by undo commands under different policies.

show abstract

Formal Design of a Parameterized Synchronization Component for Asynchronous Communication Streams

Dosch

2007

2007 IEEE/ACS International Conference on Computer Systems and Applications

View full text Add to dashboard Cite

From Stream Transformers to Moore State Transition Machines with Input and Output

Cited by 13 publications

References 11 publications

Permutable Queue as a 1-in-N-out Message Router

Permutable Queue as a 1-in-N-out Message Router

Enriching the Input Interface of Interactive Components with Undo Commands

Formal Design of a Parameterized Synchronization Component for Asynchronous Communication Streams

Contact Info

Product

Resources

About