Abstract
Widespread access to low-cost, high computing power allows for increased computerization of everyday life. However, high-performance computers alone cannot meet the demands of systems such as the Internet of Things or multi-agent robotic systems. For this reason, modern design methods are needed to develop new and extend existing projects. Because of high interest in this subject, many methodologies for designing the aforementioned systems have been developed. None of them, however, can be considered the default one to which others are compared to. Any useful methodology must provide some tools, versatility, and capability to verify its results. This paper presents an algorithm for verifying the correctness of multi-agent systems modeled as tracking bigraphical reactive systems and checking whether a behavior policy for the agents meets non-functional requirements. Memory complexity of methods used to construct behavior policies is also discussed, and a few ways to reduce it are proposed. Detailed examples of algorithm usage have been presented involving non-functional requirements regarding time and safety of behavior policy execution.
Highlights
With the increase of computational power and its availability comes the desire to incorporate it more into our daily life
This paper presents an algorithm for verifying the correctness of multi-agent systems modeled as tracking bigraphical reactive systems and checking whether a behavior policy for the agents meets non-functional requirements
The examples present how to check the fulfillment of non-functional requirements for systems designed with our methodology
Summary
With the increase of computational power and its availability comes the desire to incorporate it more into our daily life. Among different design methods elements of the real world are used differently. A task (as defined in Section 2.1) for this example consists of six elements, two actions that can be performed, and one goal. The task elements comprise three areas with two robots and an object to be carried between the areas. The goal of the task is for the robots (denoted by vertices with the control B) to move the object (denoted by a vertex with the control O) from the area AT1 to the area AT3. The tracking bigraphical reactive system for the purpose of this example consists of two reaction rules, r1 and r2, shown in Figure 8a,b, respectively. The goal of the task is to move the two robots from the area AT1 to the area AT3.
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
