Amanote Research

Amanote Research

    RegisterSign In

On Transition Time Testing Based on Extended Finite State Machines

doi 10.1007/978-0-387-34883-4_5
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 1995

Authors
Sijian ZhangSamuel T. Chanson
Publisher

Springer US


Related search

Reconfigurable Finite State Machines Based on Substitutions

Prikladnaya diskretnaya matematika. Prilozhenie
2019English

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

2009English

Design Verification and Functional Testing of Finite State Machines

English

Finite State Machines

2017English

Synthesis Method of Finite State Machines Based on State Minimization for Low Power Design

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

A Verification Procedure via Invariant for Extended Communicating Finite-State Machines

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Testing Nondeterministic Finite State Machines With Respect to the Separability Relation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

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

2010English

Hierarchical Group Decision-Making Model for Robot Soccer Based on Finite-State Transition

2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy