This paper explores the territory that lies between best-effort Byzantine-Fault-Tolerant Conflict-free Replicated Data Types (BFT CRDTs) and totally ordered distributed ledgers, such as those implemented by Blockchains. It formally characterizes ...

• We introduce PCOs, a novel class of distributed objects combining Strong Eventual Consistency and Pipeline Consistency.
• We present a generic algorithm that implements any PCO, and works both in a crash and Byzantine fault model.
• ...

We introduce a generalization of “Solo Chess”, a single-player variant of the game that can be played on chess.com. The standard version of the game is played on a regular 8 × 8 chessboard by a single player, with only white pieces, using the ...

• We formalize computational questions based on the game of Solo Chess.
• We study special cases of Solo Chess: for instance, by restricting the dimensions of the board and/or the nature of pieces involved in the game.
• We study ...

Self-stabilizing protocols enable distributed systems to recover correct behavior starting from any arbitrary configuration. In particular, when processors communicate by message passing and the communication links are unbounded, fake messages ...

P systems are non-deterministic, parallel and distributed models of computation inspired by the behaviour and structure of living cells. Spiking neural P systems synthesise the connections that exist between neurons in the human brain, using ...

Verification of parameterized protocols is of great interest in the area of formal verification, mainly due to the practical importance of such systems. Explicit-state model checking is an essential approach in which states for a system are ...

The rendezvous task calls for two mobile agents, starting from different nodes of a network modeled as a graph to meet at the same node. Agents have different labels which are integers from a set { 1 , … , L }. They wake up at possibly different ...

Given a graph G = ( V , E ), a 2-minimal dominating set (2-MDS) of G is a minimal dominating set D ⊆ V such that D ∖ { p i , p j } ∪ { p z } is not a dominating set for any nodes p i , p j ∈ D (p i ≠ p j) and p z ∉ D. We propose two silent self-...

In the context of computational complexity of puzzles, the sliding block puzzles play an important role. Depending on the rules and set of pieces, the sliding block puzzles can be polynomial-time solvable, NP-complete, or PSPACE-complete. On the ...