Version 1
: Received: 29 December 2019 / Approved: 31 December 2019 / Online: 31 December 2019 (03:52:22 CET)
How to cite:
Daszczuk, W. Modelling Distributed Systems in Distributed Autonomous and Asynchronous Automata (DA3). Preprints2019, 2019120400. https://doi.org/10.20944/preprints201912.0400.v1
Daszczuk, W. Modelling Distributed Systems in Distributed Autonomous and Asynchronous Automata (DA3). Preprints 2019, 2019120400. https://doi.org/10.20944/preprints201912.0400.v1
Daszczuk, W. Modelling Distributed Systems in Distributed Autonomous and Asynchronous Automata (DA3). Preprints2019, 2019120400. https://doi.org/10.20944/preprints201912.0400.v1
APA Style
Daszczuk, W. (2019). Modelling Distributed Systems in Distributed Autonomous and Asynchronous Automata (DA3). Preprints. https://doi.org/10.20944/preprints201912.0400.v1
Chicago/Turabian Style
Daszczuk, W. 2019 "Modelling Distributed Systems in Distributed Autonomous and Asynchronous Automata (DA3)" Preprints. https://doi.org/10.20944/preprints201912.0400.v1
Abstract
Integrated Model of Distributed Systems is used for modeling and verification. In formalism, the distributed system is modeled as a collection of server states and agent messages. The evolution of the system takes the form of actions that transform the global system configuration (states and messages) into a new configuration. Formalism is used in the Dedan verification environment for finding different kinds of deadlocks: communication deadlocks in the server view and resource deadlocks in the agent view. For other purposes, a conversion has been developed to equivalent models: to Petri nets for structural analysis and do Distributed Autonomous and Asynchronous Automata (DA3) for easy graphical modeling in terms of system components. In addition, it is possible to simulate a verified system on distributed components in DA3. The automata have two forms: Server-DA3 (S-DA3) for the server view and Agent-DA3 (A-DA3) for the agent view. DA3 formalism is compared to other concepts of distributed automata known from the literature.
Computer Science and Mathematics, Computer Science
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Commenter's Conflict of Interests:
I am the author
Comment:
This article has been published in a substantially changed form in Software and Systems Modeling (Springer), vol. 20, no. 5, DOI 10.1007/s10270-021-00917-7, under Open Access: https://trebuchet.public.springernature.app/get_content/86e907b6-abb2-4daf-b7e9-6cba1161cce0
The new title is:
"Graphic modeling in Distributed Autonomous and Asynchronous Automata (DA3)"
Commenter:
Commenter's Conflict of Interests: I am the author
https://trebuchet.public.springernature.app/get_content/86e907b6-abb2-4daf-b7e9-6cba1161cce0 The new title is:
"Graphic modeling in Distributed Autonomous and Asynchronous Automata (DA3)"