asynchronous systems
Recently Published Documents


TOTAL DOCUMENTS

244
(FIVE YEARS 9)

H-INDEX

21
(FIVE YEARS 0)

Computing ◽  
2021 ◽  
Author(s):  
Ernesto Jiménez ◽  
José Luis López-Presa ◽  
Marta Patiño-Martínez

AbstractIn anonymous distributed systems, processes are indistinguishable because they have no identity and execute the same algorithm. Currently, anonymous systems are receiving a lot of attention mainly because they preserve privacy, which is an important property when we want to avoid impersonation attacks. On the other hand, Consensus is a fundamental problem in distributed computing. It is well-known that Consensus cannot be deterministically solved in pure asynchronous anonymous systems if processes can crash (the so-called crash-stop failure model). This impossibility holds even if message losses never occur in transmission. Failure detectors are an elegant and powerful abstraction for achieving deterministic Consensus in asynchronous distributed systems. A failure detector is a distributed object that gives the processes information about crashed processes. Failure detectors have attracted so much attention in the crash-stop failure model because they provide a totally independent abstraction. $$\varOmega $$ Ω is the weakest failure detector to solve Consensus in classic asynchronous systems when a majority of processes never crash, and $$A\varOmega '$$ A Ω ′ is its implementable version for anonymous systems. As far as we know, there is a lack of works in the literature which tackle Consensus in anonymous asynchronous systems where crashed process can recover (the so-called crash-recovery failure model) and also assuming errors in transmission operations (the so-called omission failure model). Extending failure models in the system allows us to design more realistic systems and solve more practical security problems (i.e., fair exchange and the secure multiparty computation). We present, in this paper, an algorithm to solve Consensus using $$A\varOmega '$$ A Ω ′ in anonymous asynchronous systems under the crash-recovery and omission failure models. Another important contribution of this paper is a communication-efficient and latency-efficient implementation of $$A\varOmega '$$ A Ω ′ for these new failure models.


2020 ◽  
Vol 68 ◽  
pp. 817-850
Author(s):  
Wojciech Jamroga ◽  
Wojciech Penczek ◽  
Teofil Sidoruk ◽  
Piotr Dembiński ◽  
Antoni Mazurkiewicz

We propose a general semantics for strategic abilities of agents in asynchronous systems, with and without perfect information. Based on the semantics, we show some general complexity results for verification of strategic abilities in asynchronous interaction. More importantly, we develop a methodology for partial order reduction in verification of agents with imperfect information. We show that the reduction preserves an important subset of strategic properties, with as well as without the fairness assumption. We also demonstrate the effectiveness of the reduction on a number of benchmarks. Interestingly, the reduction does not work for strategic abilities under perfect information.


2020 ◽  
Vol 9 (4) ◽  
pp. 1677-1684
Author(s):  
Ayman Y. Al-Rawashdeh ◽  
Ali Dalabeeh ◽  
Abdallah Al-Zeyod ◽  
Ashraf Samarah ◽  
Ghazi Qaryouti ◽  
...  

In the current study, the general mathematical model for the calculation and analysis of asynchronous systems and transient cases in asynchronous synchronous large electrical machines was developed. The theory of magnetic fields in the teeth's circuits with a smooth surface of the rotor was used and at the same time, high harmonics of magnetic fields and its effect on the transient cases was also calculated. Performance curves were investigated using Matlab codes and evaluated under different values of  factor. The results confirmed the possibility of improving the noise harmonics on the sinusoidal wave form, which is reflected on the machines starting.


2020 ◽  
Vol 107 ◽  
pp. 54-71
Author(s):  
Ernesto Jiménez ◽  
José Luis López-Presa ◽  
Javier Martín-Rueda

2020 ◽  
Vol 161 ◽  
pp. 01033
Author(s):  
Dmitry Kochkin ◽  
Aleksei Sukonschicov

The development of information technologies requires improvement of simulation methods and mathematical apparatus. The mathematical apparatus of Petri nets is used for simulation of parallel asynchronous systems and has a broad scope. The modified fuzzy Petri nets expand the modeling capabilities of Petri nets by combining the properties of different extensions. Modified extension can serve for construction of models with a complex structure and logic of operation with the use of fuzzy logic apparatus for control on the basis of the system of production rules.


2019 ◽  
Vol 75 (12) ◽  
pp. 8262-8292
Author(s):  
Ernesto Jiménez ◽  
José Luis López-Presa ◽  
Javier Martín-Rueda

2018 ◽  
Vol 104 ◽  
pp. 162-178 ◽  
Author(s):  
Mercedes G. Merayo ◽  
Robert M. Hierons ◽  
Manuel Núñez

Sign in / Sign up

Export Citation Format

Share Document