Bounded sequence testing from deterministic finite state machines

DOI10.1016/J.TCS.2010.01.030MaRDI QIDQ964395zbMATH OpenOpenAlexFDO

Authors Florentin Ipate

Publication date 15 April 2010

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2010.01.030

zbMATH Keywords

finite state machines\(W\)-methodspecification-based testing\(Wp\)-methodtest selection

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Bounded Sequence Testing from Non-deterministic Finite State Machines
• A testing procedure for deterministic cover finite state machines
• Testing finite-state machines: state identification and verification
• Checking Completeness of Tests for Finite State Machines
• Finite state based testing of P systems
• Testing finite state machines: Fault detection
• Formal black box testing for partially specified deterministic finite state machines

Cites work

• scientific article; zbMATH DE number 1200754 (Why is no real title available?)
• scientific article; zbMATH DE number 1962773 (Why is no real title available?)
• scientific article; zbMATH DE number 1773088 (Why is no real title available?)
• scientific article; zbMATH DE number 3254909 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• An integration testing method that is proved to find all faults
• Complete deterministic stream X-machine testing
• Formal black box testing for partially specified deterministic finite state machines
• Minimal cover-automata for finite languages
• Testing Software Design Modeled by Finite-State Machines
• Testing against a non-controllable stream X-machine using state counting
• \(W_p\)-method for partially specified deterministic finite state machines

Cited in

(11)

• Kernel P systems modelling, testing and verification -- sorting case study
• Testing based on identifiable P systems using cover automata and X-machines
• Kernel P systems: from modelling to verification and testing
• Learning finite cover automata from queries
• Formal black box testing for partially specified deterministic finite state machines
• \(W_p\)-method for partially specified deterministic finite state machines
• A model learning based testing approach for kernel P systems
• RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
• A model learning based testing approach for spiking neural P systems
• Bounded Sequence Testing from Non-deterministic Finite State Machines
• Two Tests for the Linearity of Sequential Machines

This page was built for publication: Bounded sequence testing from deterministic finite state machines

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