Extending EFSMs to Specify and Test Timed Systems with Action Durations and Time-Outs

Authors:
Mercedes Merayo;Manuel Núñez;Ismael Rodríguez
Affiliations:
-;-;-
Venue:
IEEE Transactions on Computers
Year:
2008

Citing 0
Cited 11

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
A General Testability Theory

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Synthesis of distinguishing test cases for timed finite state machines

Programming and Computing Software
Testing timed systems modeled by Stream X-machines

Software and Systems Modeling (SoSyM)
InRob: An approach for testing interoperability and robustness of real-time embedded software

Journal of Systems and Software
Formal testing of timed and probabilistic systems

ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
Formal passive testing of timed systems: theory and tools

Software Testing, Verification & Reliability
A formal framework to test soft and hard deadlines in timed systems

Software Testing, Verification & Reliability
Integration testing through reusing representative unit test cases for high-confidence medical software

Computers in Biology and Medicine
A finite transition model for security protocol verification

Proceedings of the 6th International Conference on Security of Information and Networks
Using transition systems to model and verify the implementation of security protocol

Proceedings of the 6th International Conference on Security of Information and Networks

Quantified Score

Hi-index	14.98

Visualization

Abstract

In this paper we introduce a timed extension of the extended finite state machines model. On the one hand, we consider that (output) actions take time to be performed. This time may depend on several factors such as the value of variables. On the other hand, our formalism allows to specify timeouts. In addition to present our language, we develop a testing theory. First, we define ten timed conformance relations and relate them. Second, we introduce a notion of timed test and define how to apply tests to implementations. Finally, we give an algorithm to derive sound and complete test suites with respect to the implementation relations presented in the paper.