Modeling Distributed Information Systems

A special issue of Information (ISSN 2078-2489). This special issue belongs to the section "Information Systems".

Deadline for manuscript submissions: closed (31 January 2020) | Viewed by 10502

Special Issue Editor


E-Mail Website
Guest Editor
The Institute of Computer Science, Faculty of Electronics and Information Technology, Warsaw University of Technology, Poland
Interests: distributed systems modeling; distributed systems specification; distributed systems verification; distributed systems simulation

Special Issue Information

Dear Colleagues,

Modeling, specification, verification, and simulation of distributed systems are extremely important during the development of IoT systems, cloud computing, etc. However, formalisms and mechanisms for dealing with distributed systems mostly originate from the era of centralized concurrent systems and have been extended to distributed systems. Most of them are based on global (or non-local) state, synchronous communication, etc. Those approaches are unrealistic, taking into account the natural locality of decisions in distributed systems, lack of global state, asynchrony of communication, local action autonomy, inevitable nondeterminism, etc. For these reasons, we are launching a Special Issue on such aspects of modeling, specification, verification, and simulation of distributed systems that take into account their natural and inherent features. An example of such a formalism is the Integrated Model of Distributed Systems, with its many aspects and derivative models, but we encourage authors to present other formalisms related to distribution, which will allow for better design and analysis of their behavior than before.

Suggested topics:

  • Integrated Model of Distributed Systems;
  • Communication duality in distributed systems, Lauer–Needham postulate;
  • Algebraic models of distributed systems;
  • Asynchronous specification of distributed systems;
  • Automata-based modeling of distributed systems;
  • Timed specification and verification of distributed systems;
  • Probabilistic specification and verification of distributed systems;
  • Automated deadlock detection in distributed systems;
  • Fairness in verification of distributed systems;
  • Exhaustive and non-exhaustive verification of distributed systems;
  • IoT protocols verification;
  • Static analysis of distributed systems;
  • Distributed termination;
  • IMDS vs. other models of distribution;
  • Modeling code mobility in distributed systems;
  • Languages for specification of distributed systems.

Dr. Wiktor B. Daszczuk
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Information is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Published Papers (3 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

21 pages, 1642 KiB  
Article
A Social Multi-Agent Cooperation System Based on Planning and Distributed Task Allocation
by Atef Gharbi
Information 2020, 11(5), 271; https://0-doi-org.brum.beds.ac.uk/10.3390/info11050271 - 18 May 2020
Cited by 2 | Viewed by 3772
Abstract
Planning and distributed task allocation are considered challenging problems. To address them, autonomous agents called planning agents situated in a multi-agent system should cooperate to achieve planning and complete distributed tasks. We propose a solution for distributed task allocation where agents dynamically allocate [...] Read more.
Planning and distributed task allocation are considered challenging problems. To address them, autonomous agents called planning agents situated in a multi-agent system should cooperate to achieve planning and complete distributed tasks. We propose a solution for distributed task allocation where agents dynamically allocate the tasks while they are building the plans. We model and verify some properties using computation tree logic (CTL) with the model checker its-ctl. Lastly, simulations are performed to verify the effectiveness of our proposed solution. The result proves that it is very efficient as it requires little message exchange and computational time. A benchmark production system is used as a running example to explain our contribution. Full article
(This article belongs to the Special Issue Modeling Distributed Information Systems)
Show Figures

Figure 1

25 pages, 962 KiB  
Article
Tree-Like Distributed Computation Environment with Shapp Library
by Tomasz Gałecki and Wiktor Bohdan Daszczuk
Information 2020, 11(3), 143; https://0-doi-org.brum.beds.ac.uk/10.3390/info11030143 - 03 Mar 2020
Cited by 1 | Viewed by 3766
Abstract
Despite the rapidly growing computing power of computers, it is often insufficient to perform mass calculations in a short time, for example, simulation of systems for various sets of parameters, the searching of huge state spaces, optimization using ant or genetic algorithms, machine [...] Read more.
Despite the rapidly growing computing power of computers, it is often insufficient to perform mass calculations in a short time, for example, simulation of systems for various sets of parameters, the searching of huge state spaces, optimization using ant or genetic algorithms, machine learning, etc. One can solve the problem of a lack of computing power through workload management systems used in local networks in order to use the free computing power of servers and workstations. This article proposes raising such a system to a higher level of abstraction: The use in the .NET environment of a new Shapp library that allows remote task execution using fork-like operations from Portable Operating System Interface for UNIX (POSIX) systems. The library distributes the task code, sending static data on which task force is working, and individualizing tasks. In addition, a convenient way of communicating distributed tasks running hierarchically in the Shapp library was proposed to better manage the execution of these tasks. Many different task group architectures are possible; we focus on tree-like calculations that are suitable for many problems where the range of possible parallelism increases as the calculations progress. Full article
(This article belongs to the Special Issue Modeling Distributed Information Systems)
Show Figures

Figure 1

16 pages, 517 KiB  
Article
Stateless IoT
by Augusto Ciuffoletti
Information 2020, 11(2), 85; https://0-doi-org.brum.beds.ac.uk/10.3390/info11020085 - 04 Feb 2020
Cited by 2 | Viewed by 2422
Abstract
Energy consumption is a relevant matter in the design of IoT applications. Edge units—sensors and actuators—save energy by operating intermittently. When idle, they suspend their operation, losing the content of the onboard memory. Their internal state, needed to resume their work, is recorded [...] Read more.
Energy consumption is a relevant matter in the design of IoT applications. Edge units—sensors and actuators—save energy by operating intermittently. When idle, they suspend their operation, losing the content of the onboard memory. Their internal state, needed to resume their work, is recorded on external storage: in the end, their internal operation is stateless. The backend infrastructure does not follow the same design principle: concentrators, routers, and servers are always-on devices that frustrate the energy-saving operation of edge devices. In this paper, we show how serverless functions, asynchronously invoked by the stateless edge devices, are an energy-saving option. We introduce a basic model for system operation and energy footprint evaluation. To demonstrate its soundness, we study a simple use case, from the design to a prototype. Full article
(This article belongs to the Special Issue Modeling Distributed Information Systems)
Show Figures

Figure 1

Back to TopTop