Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

GECCO
2005
Springer

favoriteEmaildiscussreport

129views Optimization» more GECCO 2005»

Generating feasible input sequences for extended finite state machines (EFSMs) using genetic algorithms

13 years 9 months ago

Generating feasible input sequences for extended finite state machines (EFSMs) using genetic algorithms

Download www.cs.bham.ac.uk

Karnig Derderian, Robert M. Hierons, Mark Harman,

Real-time Traffic

GECCO 2005 |

claim paper

Related Content

» Generating Feasible Transition Paths for Testing from an Extended Finite State Machine EFS...

» Improving Correctness of FiniteState Machine Synthesis from Multiple Partial InputOutput S...

» Generating a checking sequence with a minimum number of reset transitions

» Regular Inference for State Machines Using Domains with Equality Tests

» A Formal Framework to Integrate Timed Security Rules within a TEFSMBased System Specificat...

» Testing a deterministic implementation against a noncontrollable nondeterministic stream X...

» Privacy preserving error resilient dna searching through oblivious automata

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	GECCO
Authors	Karnig Derderian, Robert M. Hierons, Mark Harman, Qiang Guo

Comments (0)