2002 · 148 citations · 20 references
EngineeringComputer EngineeringComputer ScienceFormal MethodsModel-based Systems EngineeringSystems ModelingAutomata TheoryFinite AutomataFinite State Machine ModelingFinite-state MachinesMutation AnalysisSpecification LanguagesFinite State Machine SpecificationFinite-state VerificationMutation TestingProtocol SpecificationTransition SystemsTransport Protocol Design
Proposes the application of the mutation analysis criterion in the context of specifications based on finite state machines. The main concepts of finite state machines and mutation analysis are briefly introduced. An experiment is reported which manually applies mutation analysis to a finite state machine modeling a Class 0 ISO transport protocol specification, using two test-sequence generator criteria-the W method and the TT (transition tours) method. The results obtained are presented, and evidences are given that the use of mutation analysis is effective in this context. Finally, the lines of evolution of the work presented in this paper are briefly discussed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
20
Statecharts: a visual formalism for complex systems
David Harel · Science of Computer Programming · 1987 · 6.7K citations