Abstract
In the paper, we describe a verification method for families of distributed systems generated by context-sensitive network grammar of a special kind. This grammar includes special non-terminal symbols, so called quasi-terminals, which uniquely correspond to grammar terminals. These quasi-terminals specify processes which are merging of base system processes, in contrast to simple nonterminals which specify networks of parallel compositions of the processes. The method is based on model checking technique and abstraction. An abstract representative model for a family of systems depends on their specification grammar and system properties to be verified. This model simulates the behaviour of the systems in such a way that the properties which hold for the representative model are satisfied for all these systems. The properties of the representative model can be verified by model checking method. The properties of a generated system are specified by universal branching time logic ∀CTL with finite deterministic automata as atomic formulas. We show the use of this method for verification of some properties of a multiagent system for conflict resolution, in particular, for context-dependent disambiguation in ontology population. We also suggest that this approach should be used for verification of computations on sub-grids which are sub-graphs of computation grids. In particular, we consider the computation of parity of the active processes number in a sub-grid.
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
