DIKUL - logo

Rezultati iskanja

Osnovno iskanje    Izbirno iskanje   
Iskalna
zahteva
Knjižnica

Trenutno NISTE avtorizirani za dostop do e-virov UL. Za polni dostop se PRIJAVITE.

1 2 3
zadetkov: 28
1.
  • On the completeness of boun... On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability
    Konnov, Igor; Veith, Helmut; Widder, Josef Information and computation, February 2017, 2017-02-00, Letnik: 252
    Journal Article
    Recenzirano
    Odprti dostop

    Counter abstraction is a powerful tool for parameterized model checking, if the number of local states of the concurrent processes is relatively small. In recent work, we introduced parametric ...
Celotno besedilo
Dostopno za: UL

PDF
2.
  • Resilient Real-Valued Conse... Resilient Real-Valued Consensus in Spite of Mobile Malicious Agents on Directed Graphs
    Wang, Yuan; Ishii, Hideaki; Bonnet, Francois ... IEEE transactions on parallel and distributed systems, 03/2022, Letnik: 33, Številka: 3
    Journal Article
    Recenzirano

    This article addresses novel real-valued consensus problems in the presence of malicious adversaries that can move within the network and induce faulty behaviors in the attacked agents. By adopting ...
Celotno besedilo
Dostopno za: UL
3.
  • Fault-Tolerant Clock Synchr... Fault-Tolerant Clock Synchronization Over Unreliable Channels in Wireless Sensor Networks
    Kikuya, Yuhei; Dibaji, Seyed Mehran; Ishii, Hideaki IEEE transactions on control of network systems, 12/2018, Letnik: 5, Številka: 4
    Journal Article
    Recenzirano

    In this paper, we study a distributed approach based on consensus algorithms for clock synchronization in wireless sensor networks. The sensor nodes face two types of uncertainties. One is that some ...
Celotno besedilo
Dostopno za: UL
4.
  • Synthesis of Fault-Tolerant... Synthesis of Fault-Tolerant Reliable Broadcast Algorithms with Reinforcement Learning
    Vaz, Diogo; Matos, David R.; Pardal, Miguel L. ... IEEE access, 01/2023, Letnik: 11
    Journal Article
    Recenzirano
    Odprti dostop

    Fault-tolerant algorithms, such as Reliable Broadcast , assure the correct operation of modern distributed systems, even when some of the system nodes fail. However, the development of distributed ...
Celotno besedilo
Dostopno za: UL
5.
  • Resiliency against maliciou... Resiliency against malicious agents in maximum-based consensus
    Nakamura, Masahiro; Ishii, Hideaki; Dibaji, Seyed Mehran SICE Journal of Control, Measurement, and System Integration, 01/01/2021, 2021-01-01, Letnik: 14, Številka: 1
    Journal Article
    Odprti dostop

    In this paper, we develop distributed algorithms for achieving resilient consensus via the maximum value-based approach when adversarial agents may be present in the network. The adversaries intend ...
Celotno besedilo
Dostopno za: UL

PDF
6.
  • Resilient Consensus for Mul... Resilient Consensus for Multi-Agent Systems Under Adversarial Spreading Processes
    Wang, Yuan; Ishii, Hideaki; Bonnet, Francois ... IEEE transactions on network science and engineering, 09/2022, Letnik: 9, Številka: 5
    Journal Article
    Recenzirano
    Odprti dostop

    This paper addresses novel consensus problems for multi-agent systems operating in an unreliable environment where adversaries are spreading. The dynamics of the adversarial spreading processes ...
Celotno besedilo
Dostopno za: UL
7.
  • Coordinated cooperative tas... Coordinated cooperative task computing using crash-prone processors with unreliable multicast
    Davtyan, Seda; De Prisco, Roberto; Georgiou, Chryssis ... Journal of parallel and distributed computing, November 2017, 2017-11-00, Letnik: 109
    Journal Article
    Recenzirano

    This paper presents a new message-passing algorithm, called Do-UM, for distributed cooperative task computing in synchronous settings where processors may crash, and where any multicasts (or ...
Celotno besedilo
Dostopno za: UL
8.
  • On the impact of link fault... On the impact of link faults on Byzantine agreement
    Biely, Martin Information and computation, 12/2014, Letnik: 239
    Journal Article
    Recenzirano
    Odprti dostop

    Agreement problems and their solutions are essential to fault-tolerant distributed computing. Over the years, different assumptions on failures have been considered, but most of these assumptions ...
Celotno besedilo
Dostopno za: UL

PDF
9.
  • IMPOSSIBILITY RESULTS AND L... IMPOSSIBILITY RESULTS AND LOWER BOUNDS FOR CONSENSUS UNDER LINK FAILURES
    SCHMID, Ulrich; WEISS, Bettina; KEIDAR, Idit SIAM journal on computing, 01/2009, Letnik: 38, Številka: 5
    Journal Article
    Recenzirano
    Odprti dostop

    We provide a suite of impossibility results and lower bounds for the required number of processes and rounds for synchronous consensus under transient link failures. Our results show that consensus ...
Celotno besedilo
Dostopno za: CEKLJ, UL

PDF
10.
Celotno besedilo
Dostopno za: UL
1 2 3
zadetkov: 28

Nalaganje filtrov