Failure-equivalent transformation of transition systems to avoid internal actions

Luo, Gang; Bochmann, Gregor von; Das, Asis; Wu, Cheng

doi:10.1016/0020-0190(92)90110-h

Cited by 8 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A stable composite machine St3 can be obtained from the slow composite machine by replacing all internal actions with the unobservable action 't and subsequently hiding 't in the obtained LTS by performing the failure-equivalent transformation as defined in [8] . Then, a nondeterministic stable composite machine indicates the presence of races.…”

Section: S After-ext A)mentioning

confidence: 99%

Verification and Testing of Concurrent Systems with Action Races

Petrenko

Ulrich

2000

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

Section: S After-ext A)mentioning

confidence: 99%

Verification and Testing of Concurrent Systems with Action Races

Petrenko

Ulrich

2000

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

“…We assume that a "reliable" reset input r is available in any implementation of a PNFSM such that upon receiving r in any state the implementation returns to the initial state. We do not include spontaneous transitions (or called internal actions) in our model, since the PNFSM's that allow spontaneous transitions can be modeled by equivalent PNFSM's without spontaneous transitions using an approach similar to the one in [27].…”

Section: )mentioning

confidence: 99%

Selecting Test Sequences for Partially-Specified Nondeterministic Finite State Machines

Petrenko

Bochmann

Luo

1995

Protocol Test Systems

Self Cite

100

View full text Add to dashboard Cite

In order to test the control portion of communication software, specifications are usually fll"St abstracted to state machines, then test cases are generated from the resulting machines. The state machines obtained from the specification are often both partially-specified and nondeterministic, but no former work has been reported on test generation for such state machines. We come out with a method of generating test suites for the software that is modeled by partially-specified nondeterministic fmite state machines (PNFSM's). On the basis of intuitive notions, a conformance relation, called quasi-equivalence, is introduced for such machines, which serves as a guide to test generation. Our method is also applicable to completely-specified deterministic machines, partially-specified deterministic machines, and completely-specified nondeterministic machines, which are typical classes of PNFSM's. When applied to such classes of machines, this method yields not greater test suites with full fault coverage for each class of machines than the existing methods for the same class which also provide full fault coverage, when the number of states in implementation machines is bounded by a known integer. The test suites generated by the method can be used to check the conformance relation between a specification and its implementations.

show abstract

“…Non observable non determinism is not detectable by means of testing (as indicated by its name). Observable non determinism is handled by improved versions of the classical test methods in the world of I10FSM [1], [15], and by adaptation of these methods to L TS [16].…”

mentioning

confidence: 99%

Some Issues on Testing Theory and its Applications

Cavalli

Phalippou

1995

Protocol Test Systems

View full text Add to dashboard Cite

This paper presents a summary of some issues that appear to be relevant to testing theory and its applications. These issues are linked to formal methods used for test derivation, to the semantic models chosen to represent these specifications, and to the appropriate techniques needed for selecting a reasonable test effort. A discussion is presented in a polemical fashion trying to illustrate the problems related to the translation of one model into another, to non deterministic and partially specified systems, to the size of the specifications and test suites and the ways to reduce them.

show abstract

Failure-equivalent transformation of transition systems to avoid internal actions

Cited by 8 publications

References 7 publications

Verification and Testing of Concurrent Systems with Action Races

Verification and Testing of Concurrent Systems with Action Races

Selecting Test Sequences for Partially-Specified Nondeterministic Finite State Machines

Some Issues on Testing Theory and its Applications

Contact Info

Product

Resources

About