Abstract
In this paper, we describe a verification method for families of distributed systems generated by a context-sensitive network grammar of a special kind. The grammar includes special non-terminal symbols, so-called quasi-terminals, which uniquely correspond to grammar terminals. These quasi-terminals specify processes that are mergings of basic system processes; in contrast, simple nonterminals specify networks of parallel compositions of these processes. The verification method is based on the model-checking technique and abstraction. An abstract representative model for a family of systems depends on their specification grammar and the system properties to be verified. This model simulates the behavior of the systems in such a way that the properties holding for the representative model are satisfied for all these systems. The properties of the representative model can be verified by the model-checking method. The properties of the system generated are specified using the universal branching time logic ∀CTL with finite deterministic automata as atomic formulas. We demonstrate the application of the proposed method to verification of some properties of a multiagent system for conflict resolution, particularly for context-dependent disambiguation in ontology population. We also suggest that this approach should be used for verification of computations on subgrids that are subgraphs of computation grids. In particular, it can be used to compute the parity of the number of active processes in a subgrid.
Highlights
Теорема 2 влечет, что для каждого a, выводимого в грамматике G, верно h(rep(S)) a. 3
O., Sidorova E.A., "An Approach to Verification of a Family of Multiagent Systems for Conflict Resolution", Modeling and Analysis of Information Systems, 23:6 (2016), 703–714
Summary
Дадим необходимые определения из [2] в адаптированном виде. Изменения касаются оператора слияния и квази-терминалов сетевой грамматики. – S множество состояний, – S0 ⊆ S множество начальных состояний, – ACT множество действий, и – R ⊆ S × ACT × S тотальное отношение переходов такое, что для каждого s ∈ S существует действие a и состояния s , для которого (s, a, s ) ∈ R (обозначается как s −→a s ). Пусть S – это множество состояний и ACT множество действий. – Qt множество квази-терминалов, каждый из которых является LTS из класса L(S,ACT ), их слияние определяет LTS,. Расширенная на FD, определяется как h(f ) = f для f ∈ FD и расширение функций h на (S ∪ FD) это h((a1, a2, ..., an)) = h(a1) ◦ ... (абстрактной LTS) Для данной LTS M = (Si, R, ACT, S0) в сети N , соответствующая абстрактная LTS определяется как h(M ) = (Sh, Rh, ACT, S0h), где.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
