Symbolic modeling of basic protocols systems with arbitrary number of agents
A method of symbolic modeling of formal models is considered in the paper. Object of analysis is a domain of multi-component concurrent systems specified in basic protocols language. A problem of dynamic creation and stopping of agents during state-space exploration is considered. Corresponding al...
Збережено в:
| Дата: | 2013 |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Інститут проблем штучного інтелекту МОН України та НАН України
2013
|
| Назва видання: | Искусственный интеллект |
| Теми: | |
| Онлайн доступ: | http://dspace.nbuv.gov.ua/handle/123456789/85228 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Цитувати: | Symbolic modeling of basic protocols systems with arbitrary number of agents / S.V. Potiyenko // Искусственный интеллект. — 2013. — № 4. — С. 81–88. — Бібліогр.: 8 назв. — англ. |
Репозитарії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Резюме: | A method of symbolic modeling of formal models is considered in the paper. Object of analysis is a domain
of multi-component concurrent systems specified in basic protocols language. A problem of dynamic
creation and stopping of agents during state-space exploration is considered. Corresponding algorithm has
been suggested as an extension of existing forward and backward predicate transformers. It provides ability
to introduce arbitrary number of concurrent processes in verification and test generation. |
|---|