Theoretical Computer Science
Distinguishing tests for nondeterministic and probabilistic machines
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Testing deterministic implementations from nondeterministic FSM specifications
Selected proceedings of the IFIP TC6 9th international workshop on Testing of communicating systems
Theoretical Computer Science
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Timed Wp-Method: Testing Real-Time Systems
IEEE Transactions on Software Engineering
Testing from a Nondeterministic Finite State Machine Using Adaptive State Counting
IEEE Transactions on Computers
Formal testing from timed finite state machines
Computer Networks: The International Journal of Computer and Telecommunications Networking
Extending EFSMs to Specify and Test Timed Systems with Action Durations and Time-Outs
IEEE Transactions on Computers
Distinguing Non-deterministic Timed Finite State Machines
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Conformance tests as checking experiments for partial nondeterministic FSM
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
On deriving test suites for nondeterministic finite state machines with time-outs
Programming and Computing Software
| Hi-index | 0.00 |
This paper is devoted to the generation of distinguishing experiments with completely specified timed finite state machines. It is shown, in particular, that two completely specified nondeterministic finite state machines can be distinguished by a multiple preset experiment if and only if these finite state machines are not equivalent. Two finite state machines can be distinguished by a simple adaptive experiment if and only if they are r-distinguishable, i.e., have no common completely specified reduction. The corresponding adaptive experiment is described by a special timed finite state machine. The procedure for constructing such an r-distinguishing timed finite state machine is proposed.