State Identification for Labeled Transition Systems with Inputs and Outputs

  title={State Identification for Labeled Transition Systems with Inputs and Outputs},
  author={Petra van den Bos and F. Vaandrager},
  • Petra van den Bos, F. Vaandrager
  • Published 2019
  • Computer Science
  • ArXiv
  • 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

    Figures, Tables, and Topics from this paper


    State identification problems for input/output transition systems
    • 5
    Testing Finite-State Machines: State Identification and Verification
    • 289
    • Highly Influential
    • PDF
    Distinguishing tests for nondeterministic and probabilistic machines
    • 145
    • Highly Influential
    Nominal Techniques and Black Box Testing for Automata Learning
    • 10
    Generating Complete and Finite Test Suite for ioco: Is It Possible?
    • 21
    • PDF
    Conformance Tests as Checking Experiments for Partial Nondeterministic FSM
    • 57
    Applying Automata Learning to Embedded Control Software
    • 54
    • PDF
    Testing from a nondeterministic finite state machine using adaptive state counting
    • R. Hierons
    • Computer Science
    • IEEE Transactions on Computers
    • 2004
    • 84
    • PDF
    Principles of model checking
    • 4,071
    • PDF