State Identification for Labeled Transition Systems with Inputs and Outputs
@article{Bos2019StateIF, title={State Identification for Labeled Transition Systems with Inputs and Outputs}, author={Petra van den Bos and F. Vaandrager}, journal={ArXiv}, year={2019}, volume={abs/1907.11034} }
For Finite State Machines (FSMs) a rich testing theory has been developed to discover aspects of their behavior and ensure their correct functioning. Although this theory is widely used, e.g., to check conformance of protocol implementations, its applicability is limited by restrictions of the FSM framework: the fact that inputs and outputs alternate in an FSM, and outputs are fully determined by the previous input and state. Labeled Transition Systems with inputs and outputs (LTSs), as studied… CONTINUE READING
Supplemental Presentations
Figures, Tables, and Topics from this paper
References
SHOWING 1-10 OF 36 REFERENCES
State identification problems for input/output transition systems
- Mathematics
- 2008 9th International Workshop on Discrete Event Systems
- 2008
- 5
Testing Finite-State Machines: State Identification and Verification
- Mathematics, Computer Science
- IEEE Trans. Computers
- 1994
- 289
- Highly Influential
- PDF
Distinguishing tests for nondeterministic and probabilistic machines
- Computer Science
- STOC '95
- 1995
- 145
- Highly Influential
Generating Complete and Finite Test Suite for ioco: Is It Possible?
- Mathematics, Computer Science
- MBT
- 2014
- 21
- PDF
Conformance Tests as Checking Experiments for Partial Nondeterministic FSM
- Mathematics, Computer Science
- FATES
- 2005
- 57
Testing from a nondeterministic finite state machine using adaptive state counting
- Computer Science
- IEEE Transactions on Computers
- 2004
- 84
- PDF