X-machines as a basis for dynamic system specification
Software Engineering Journal
Debugging Concurrent Ada Programs by Deterministic Execution
IEEE Transactions on Software Engineering
Synthesis of test experiments in some classes of automata
Automatic Control and Computer Sciences
Selecting test sequences for partially-specified nondeterministic finite state machines
IWPTS '94 7th IFIP WG 6.1 international workshop on Protocol test systems
On Minimizing the Lengths of Checking Sequences
IEEE Transactions on Computers
Automata, Languages, and Machines
Automata, Languages, and Machines
Modeling Reactive Systems with Statecharts: The Statemate Approach
Modeling Reactive Systems with Statecharts: The Statemate Approach
Reduced Length Checking Sequences
IEEE Transactions on Computers
IEEE Transactions on Software Engineering
P Systems with replicated rewriting and stream X-machines (Eilenberg machines)
Fundamenta Informaticae - Membrane computing
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Testing from Formal Specifications, a Generic Approach
Ada Europe '01 Proceedings of the 6th Ade-Europe International Conference Leuven on Reliable Software Technologies
Generation of Adaptive Test Cases from Nondeterministic Finite State Models
Proceedings of the IFIP TC6/WG6.1 Fifth International Workshop on Protocol Test Systems V
PX systems = P systems + X machines
Natural Computing: an international journal
Testing from a Nondeterministic Finite State Machine Using Adaptive State Counting
IEEE Transactions on Computers
Testing conformance of a deterministic implementation against a non-deterministic stream X-machine
Theoretical Computer Science
Testing from Partial Deterministic FSM Specifications
IEEE Transactions on Computers
Towards a Hybrid Formal Method for Swarm-Based Exploration Missions
SEW '05 Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop
Optimizing the Length of Checking Sequences
IEEE Transactions on Computers
Testing against a non-controllable stream X-machine using state counting
Theoretical Computer Science
A State Exploration-Based Approach to Testing Java Monitors
ISSRE '06 Proceedings of the 17th International Symposium on Software Reliability Engineering
Reachability Testing of Concurrent Programs
IEEE Transactions on Software Engineering
A Method for the Design of Fault Detection Experiments
IEEE Transactions on Computers
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
Fault detecting experiments for sequential circuits
SWCT '64 Proceedings of the 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
Using formal specifications to support testing
ACM Computing Surveys (CSUR)
Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine
Formal Aspects of Computing
Finite automata and their decision problems
IBM Journal of Research and Development
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Hi-index | 5.23 |
Stream X-machines are a state based formalism that has associated with it a particular development process in which a system is built from trusted components. Testing thus essentially checks that these components have been combined in a correct manner and that the orders in which they can occur are consistent with the specification. Importantly, there are test generation methods that return a checking experiment: a test that is guaranteed to determine correctness as long as the implementation under test (IUT) is functionally equivalent to an unknown element of a given fault domain @J. Previous work has show how three methods for generating checking experiments from a finite state machine (FSM) can be adapted to testing from a stream X-machine. However, there are many other methods for generating checking experiments from an FSM and these have a variety of benefits that correspond to different testing scenarios. This paper shows how any method for generating a checking experiment from an FSM can be adapted to generate a checking experiment for testing an implementation against a stream X-machine. This is the case whether we are testing to check that the IUT is functionally equivalent to a specification or we are testing to check that every trace (input/output sequence) of the IUT is also a trace of a nondeterministic specification. Interestingly, this holds even if the fault domain @J used is not that traditionally associated with testing from a stream X-machine. The results also apply for both deterministic and nondeterministic implementations.