Generating Feasible Transition Paths for Testing From an Extended Finite State Machine (EFSM) With the Counter Problem

doi 10.1109/icstw.2010.25
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

Generating Feasible Transition Paths for Testing From an Extended Finite State Machine (EFSM)

2009English

Test Generation From an Extended Finite State Machine as a Multiobjective Optimization Problem

English

On Transition Time Testing Based on Extended Finite State Machines

1995English

Expanding an Extended Finite State Machine to Aid Testability

English

Blended Local Planning for Generating Safe and Feasible Paths

2008English

Testing From a Finite-State Machine: Extending Invertibility to Sequences

Computer Journal
Computer Science
1997English

A Novel Framework for Test Domain Reduction Using Extended Finite State Machine

2007English

A Method to Derive a Single-Efsm From Communicating Multi-Efsm for Data Part Testing

1997English

An Exact Extended Formulation for the Unrelated Parallel Machine Total Weighted Completion Time Problem

Journal of Scheduling
Management ScienceEngineeringOperations ResearchArtificial IntelligenceSoftware
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy