Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (2)

Search Parameters:
Keywords = extended bigraph

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
25 pages, 6931 KiB  
Article
Dynamic Evolution Method and Symmetric Consistency Analysis for Big Data-Oriented Software Architecture Based on Extended Bigraph
by Chaoze Lu and Qifeng Zou
Symmetry 2025, 17(4), 626; https://doi.org/10.3390/sym17040626 - 21 Apr 2025
Cited by 1 | Viewed by 322
Abstract
With the development of artificial intelligence technology, there are increasingly high requirements for processing big data systems. Big data systems have undergone rapid evolution in response to changing demands. Due to the complex structural connections and dispersed component positions of big data processing [...] Read more.
With the development of artificial intelligence technology, there are increasingly high requirements for processing big data systems. Big data systems have undergone rapid evolution in response to changing demands. Due to the complex structural connections and dispersed component positions of big data processing systems, traditional formal methods find it difficult to dynamically model their structure and position simultaneously. To address this issue, this study proposes a formal modeling framework that extends Bigraph to support the dynamic evolution of big data software architecture. This model is capable of verifying the symmetry consistency of structural connections and component positions in evolutionary systems and evaluating them through real-life case studies of banking big data systems. The results confirmed its correctness and practical feasibility. Full article
(This article belongs to the Section Computer)
Show Figures

Figure 1

35 pages, 3383 KiB  
Article
Design and Verification of Multi-Agent Systems with the Use of Bigraphs
by Piotr Cybulski and Zbigniew Zieliński
Appl. Sci. 2021, 11(18), 8291; https://doi.org/10.3390/app11188291 - 7 Sep 2021
Cited by 1 | Viewed by 2290
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 [...] Read more.
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. Full article
(This article belongs to the Special Issue Advances in Industrial Robotics and Intelligent Systems)
Show Figures

Figure 1

Back to TopTop