Bounded sequence testing from deterministic finite state machines

DOI10.1016/j.tcs.2010.01.030zbMath1192.68414OpenAlexW2013233534MaRDI QIDQ964395

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)

Related Items (7)

Kernel P systems: from modelling to verification and testing ⋮ A model learning based testing approach for spiking neural P systems ⋮ Learning finite cover automata from queries ⋮ A model learning based testing approach for kernel P systems ⋮ Kernel P Systems Modelling, Testing and Verification - Sorting Case Study ⋮ RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS ⋮ Testing based on identifiable P systems using cover automata and X-machines

Cites Work

• Complete deterministic stream X-machine testing
• Testing against a non-controllable stream X-machine using state counting
• Testing Software Design Modeled by Finite-State Machines
• An integration testing method that is proved to find all faults
• Minimal cover-automata for finite languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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