Checking robustness of web services based on the parallel composition of partial timed finite state machines
In this paper, we discuss how the robustness of the web service can be checked using the parallel composition of partial timed finite state machines. We propose a technique for checking this property. In fact, we check whether there are no deadlocks in the composition. If deadlocks can happen, then...
Published in: | Proceedings of IEEE East-West Design & Test Symposium (EWDTS'2018), Kazan, Russia, September 14-17, 2018 P. 256-261 |
---|---|
Main Author: | Shirokova, Ekaterina V. |
Format: | Book Chapter |
Language: | English |
Subjects: | |
Online Access: | http://vital.lib.tsu.ru/vital/access/manager/Repository/vtls:000659558 |
Similar Items
- Using models of finite transition systems for checking Web-service security
-
Experiments on parallel composition of timed finite state machines
by: Sotnikov A. P. -
Generating checking sequences for nondeterministic finite state machines
by: Petrenko, Alexandre F. -
Optimizing components of finite state machines composition based on don’t care input sequences in hardware implementation
by: Shirokova, Ekaterina V. - Minimizing deterministic timed finite state machines