Statecharts: A visual formalism for complex systems
Science of Computer Programming
A proof of the Kahn principle for input/output automata
Information and Computation
Handbook of logic in computer science (vol. 1)
Handbook of logic in computer science (vol. 4)
Why interaction is more powerful than algorithms
Communications of the ACM
Specification and development of interactive systems: focus on streams, interfaces, and refinement
Specification and development of interactive systems: focus on streams, interfaces, and refinement
Automata, Languages, and Machines
Automata, Languages, and Machines
From Stream Transformers to Moore State Transition Machines with Input and Output
SNPD-SAWN '06 Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Time-awareness and Proactivity in Models of Interactive Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Transforming stream processing functions into state transition machines
SERA'04 Proceedings of the Second international conference on Software Engineering Research, Management and Applications
Model checking for input/output properties of a black-box model
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
Transformational design of an interactive component straddling communication streams
Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science, Software Engineering, Information Technology, e-Business, and Applications, 2004
Implementing Services by Partial State Machines
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
| Hi-index | 0.00 |
The external behaviour of an interactive component refers to the communication histories on the input and output channels. The component's implementation employs an internal state where inputs effect output and an update of the state. The black-box view is modelled by a stream processing function from input to output streams, the glass-box view by a state transition machine. We present a formal method how to implement a stream processing function with several arguments by a state transition machine in a correctness preserving way. The transformation involves two important steps, called differentiation and history abstraction. The differentiation localizes the effect of a single input on one of the input channels wrt. the previous input histories. The history abstraction introduces states as congruence classes of input histories. We extend our previous results from interactive components with one input channel to components with several input channels. The generalization employs a 'diamond property' for states and outputs which ensures the confluence of the resulting state transition system.