Bounded Sequence Testing from Non-deterministic Finite State Machines

DOI10.1007/11754008_4zbMATH Open1185.68092OpenAlexW1511026877MaRDI QIDQ3434652FDOQ3434652

Florentin Ipate

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11754008_4

Recommendations

• Bounded sequence testing from deterministic finite state machines
• A testing procedure for deterministic cover finite state machines
• Test suites derivation for nondeterministic finite state machines with respect to the separability relation
• Test suites derivation for nondeterministic finite state machines with respect to the separability relation
• On the synthesis of adaptive tests for nondeterministic finite state machines
• scientific article; zbMATH DE number 6125212
• On deriving test suites for nondeterministic finite state machines with time-outs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cited In (8)

• An empirical evaluation of P system testing techniques
• Conformance Tests as Checking Experiments for Partial Nondeterministic FSM
• Learning finite cover automata from queries
• Bounded sequence testing from deterministic finite state machines
• Active learning of nondeterministic finite state machines
• Finite state based testing of P systems
• Title not available (Why is that?)
• Two Tests for the Linearity of Sequential Machines

This page was built for publication: Bounded Sequence Testing from Non-deterministic Finite State Machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434652)