scientific article

Publication date: 3 April 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

distributed algorithms distributed information processing

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Parallel algorithms in computer science (68W10)

Related Items

Distributed Adaptive Systems, On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency, Star-Topology Decoupling in SPIN, A Formal Model for Polarization under Confirmation Bias in Social Networks, Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker, Distributed multi‐vehicle coordinated control via local information exchange, A control‐theoretic perspective on the design of distributed agreement protocols, Local deal-agreement algorithms for load balancing in dynamic general graphs, Synchronous \(t\)-resilient consensus in arbitrary graphs, Short paper: On game-theoretically-fair leader election, Three attacks on proof-of-stake ethereum, Almost universal anonymous rendezvous in the plane, Improved deterministic leader election in diameter-two networks, Four shades of deterministic leader election in anonymous networks, Finite-time consensus for leader-follower and leaderless swarms in the presence of malicious agents, Termination of amnesiac flooding, Cooperative distributed state estimation: resilient topologies against smart spoofers, Distributed asynchronous consensus control of nonlinear multi-agent systems under directed switching topologies, A basic compositional model for spiking neural networks, Search on a Line by Byzantine Robots, Neighbourhood message passing computation on a lattice with cP systems, Routing schemes for hybrid communication networks, Neighborhood mutual remainder: self-stabilizing distributed implementation and applications, State-efficient realization of fault-tolerant FSSP algorithms, Asymptotic optimality for decentralised bandits, Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures, Unnamed Item, \textsc{FnF-BFT}: a BFT protocol with provable performance under attack, On certifying distributed algorithms: problem of local correctness, Byzantine-resilient distributed observers for LTI systems, Self-stabilizing indulgent zero-degrading binary consensus, On tolerance of discrete systems with respect to transition perturbations, On the Validity of Consensus, Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication, Improved Tradeoffs for Leader Election, Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience, Simple Neural-Like P Systems for Maximal Independent Set Selection, Fair simulation, Fast asynchronous systems in dense time, Transmitting once to elect a leader on wireless networks, How long it takes for an ordinary node with an ordinary ID to output?, Searching games with errors -- fifty years of coping with liars, Self-stabilizing \(\ell\)-exclusion, Gathering in the plane of location-aware robots in the presence of spies, On the exact round complexity of secure three-party computation, Simple and efficient local codes for distributed stable network construction, Finite-state concurrent programs can be expressed in pairwise normal form, Topology recognition and leader election in colored networks, Wait-freedom with advice, On Verifying Fault Tolerance of Distributed Protocols, Near-optimal self-stabilising counting and firing squads, Wait-free solvability of colorless tasks in anonymous shared-memory model, An efficient distributed algorithm for finding all hinge vertices in networks, A distributed computing perspective of unconditionally secure information transmission in Russian cards problems, On the Complexity of Universal Leader Election, Fair Exchange Is Incomparable to Consensus, Necessary and sufficient condition for average consensus of networked multi-agent systems with heterogeneous time delays, Unnamed Item, Quantifying Probabilistic Information Flow in Computational Reactive Systems, Discussion on: ``Development and experimental verification of a mobile client-centric networked controlled system, Distributed adaptive Newton methods with global superlinear convergence, Mutual exclusion as a matter of priority, Self-stabilizing timestamps, Improved time bounds for linearizable implementations of abstract data types, A visit to mutual exclusion in seven dates, Generalized interface automata with multicast synchronization, Shared-object system equilibria: delay and throughput analysis, Byzantine gathering in polynomial time, Parameterized verification of leader/follower systems via first-order temporal logic, Perfectly-secure asynchronous MPC for general adversaries (extended abstract), Consensus for wireless sensor networks with Markovian switching topology and stochastic communication noises, Counter machines and distributed automata -- a story about exchanging space and time, Terminating distributed construction of shapes and patterns in a fair solution of automata, Geometric and combinatorial views on asynchronous computability, Fault-tolerant multiparty session types, Event-triggered consensus of nonlinear multi-agent systems with stochastic switching topology, Orbit consensus of quantum networks based on interaction design, Consensus stability analysis for stochastic multi-agent systems with multiplicative measurement noises and Markovian switching topologies, Highly-fair bakery algorithm using symmetric tokens, Interactive foundations of computing, GHS algorithm on a graph with random weights, Compact routing messages in self-healing trees, Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems, A framework for automated distributed implementation of component-based models, The correctness proof of Ben-Or's randomized consensus algorithm, Gathering identical autonomous systems on a circle using stigmergy, Faster asynchronous systems., Stability of long-lived consensus., A stochastic approach to shortcut bridging in programmable matter, \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms, Fast leader election in anonymous rings with bounded expected delay, Stabilizing data-link over non-FIFO channels with optimal fault-resilience, An automata-theoretic approach to the verification of distributed algorithms, The inherent price of indulgence, GeoQuorums: implementing atomic memory in mobile ad hoc networks, Randomized leader election, Snap-stabilization and PIF in tree networks, A family of optimal termination detection algorithms, Failure detectors as type boosters, HyperTree for self-stabilizing peer-to-peer systems, Renaming in synchronous message passing systems with Byzantine failures, When consensus meets self-stabilization, Hybrid I/O automata., Resilient consensus of switched multi-agent systems, Self-stabilizing repeated balls-into-bins, Resilience against misbehaving nodes in asynchronous networks, Communication and location discovery in geometric ring networks, Byzantine-tolerant causal broadcast, MinMax algorithms for stabilizing consensus, Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds, Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks, The complexity of leader election in diameter-two networks, Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge, Verifying the consistency of remote untrusted services with conflict-free operations, Approximate agreement under mobile Byzantine faults, Impact of knowledge on election time in anonymous networks, Parallel alternating direction method of multipliers, Distributed containment control of networked fractional-order systems with delay-dependent communications, Making asynchronous distributed computations robust to noise, Search on a line with faulty robots, A modular framework for verifying versatile distributed systems, Ensuring liveness properties of distributed systems: open problems, From distributed coordination to field calculus and aggregate computing, Reaching approximate Byzantine consensus with multi-hop communication, A simple Byzantine generals protocol, Synchronization of networks with time-varying couplings, On fast-slow consensus networks with a dynamic weight, Measuring the performance of asynchronous systems with PAFAS, A simplicial complex model for dynamic epistemic logic to study distributed task computability, Higher-order quantifier elimination, counter simulations and fault-tolerant systems, Periodic consensus in network systems with general distributed processing delays, A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks, Advice complexity of treasure hunt in geometric terrains, Resilient self/event-triggered consensus based on ternary control, Output-based dynamic event-triggered consensus control for linear multiagent systems, Exact communication costs for consensus and leader in a tree, Cooperative computing with fragmentable and mergeable groups, How many cooks spoil the soup?, On modelling mobility, Revisiting the PAXOS algorithm, Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability, Eventually-serializable data services, A bivalency proof of the lower bound for uniform consensus, Stochastic consensus control of multi-agent systems under general noises and delays, Non-oscillating quantized average consensus over dynamic directed topologies, A time-optimal distributed sorting algorithm on a line network., Wait-free Byzantine consensus., A simple proof of the uniform consensus synchronous lower bound., Performance measure sensitive congruences for Markovian process algebras, Fair simulation, Distributed computation with continual population growth, Linear parametric model checking of timed automata, Synthesis in presence of dynamic links, A minimal property for characterizing deadlock-free programs, Efficiency of asynchronous systems, read arcs, and the MUTEX-problem, Directed cycles and related structures in random graphs. I: Static properties, Specification of real-time and hybrid systems in rewriting logic, Moded and continuous abstract state machines, A multi-agent model for polarization under confirmation bias in social networks, Fragmented objects: boosting concurrency of shared large objects, The expressive power of snap-stabilization, Distributed finite-time calculation of node eccentricities, graph radius and graph diameter, Time bounds on synchronization in a periodic distributed system, Simple and optimal randomized fault-tolerant rumor spreading, Concurrent abstract state machines, How to safely close a discussion, On the diversity of asynchronous communication, Sampled-data based average consensus with measurement noises: convergence analysis and uncertainty principle, Distributed universality, Light-weight leases for storage-centric coordination, A bypassing path based routing algorithm for the pyramid structures, Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds, Synthesis of large dynamic concurrent programs from dynamic specifications, Performance of pipelined asynchronous systems, Graph process specifications for hybrid networked systems, Innovations in computational type theory using Nuprl, Concurrent forward bounding for distributed constraint optimization problems, Anonymous asynchronous systems: the case of failure detectors, Bisimulation on speed: Worst-case efficiency, A distributed resource allocation algorithm for many processes, A generalized broadcasting schema for the mesh structures, A criterion for atomicity revisited, Byzantine agreement with homonyms in synchronous systems, Solving the at-most-once problem with nearly optimal effectiveness, Computing with infinitely many processes, Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings, The weakest failure detector to implement a register in asynchronous systems with hybrid communication, Power and limits of distributed computing shared memory models, On the performance of a retransmission-based synchronizer, Deterministic geoleader election in disoriented anonymous systems, Leader election in ad hoc radio networks: a keen ear helps, Iterated chromatic subdivisions are collapsible, An interface theory for service-oriented design, Synchronous counting and computational algorithm design, Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks, Causality, influence, and computation in possibly disconnected synchronous dynamic networks, Reconfigurable distributed storage for dynamic networks, The distributed wireless gathering problem, Consensus in the presence of mortal Byzantine faulty processes, Reconciling fault-tolerant distributed computing and systems-on-chip, Verification of distributed systems with local-global predicates, Secure message transmission in asynchronous networks, Model checking probabilistic systems against pushdown specifications, Message and time efficient consensus protocols for synchronous distributed systems, Using asynchrony and zero degradation to speed up indulgent consensus protocols, Consensus of second-order discrete-time multi-agent systems with fixed topology, Finite-time weighted average consensus with respect to a monotonic function and its application, Book review of: Robin Sharp, Principles of protocol design, Computational models for networks of tiny artifacts: a survey, The renaming problem in shared memory systems: an introduction, The cost of probabilistic agreement in oblivious robot networks, An optimal bit complexity randomized distributed MIS algorithm, The gap in circumventing the impossibility of consensus, Sublinear bounds for randomized leader election, \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks, The complexity of updating snapshot objects, Help when needed, but no more: efficient read/write partial snapshot, Optimal distributed linear averaging, Adaptive broadcast by fault-tolerant spanning tree switching, Consensus of second-order multi-agent systems in the presence of locally bounded faults, A coded shared atomic memory algorithm for message passing architectures, Randomized mutual exclusion on a multiple access channel, Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring, CPO semantics of timed interactive actor networks, A distributed O(1)-approximation algorithm for the uniform facility location problem, Mean square average-consensus under measurement noises and fixed topologies: necessary and sufficient conditions, Distributed fault detection and isolation of continuous-time non-linear systems, Gradient clock synchronization in dynamic networks, A control-theoretic approach to disseminating values and overcoming malicious links in wireless networks, Turing machines, transition systems, and interaction, The impossibility of boosting distributed service resilience, Space efficient and time optimal distributed BFS tree construction, Gossiping by processors prone to omission failures, Fork sequential consistency is blocking, Strong order-preserving renaming in the synchronous message passing model, Formalization and correctness of the PALS architectural pattern for distributed real-time systems, Adaptive fast consensus algorithm for distributed sensor fusion, Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures, P systems and the Byzantine agreement, Synchronous consensus under hybrid process and link failures, Some problems in distributed computational geometry, A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems, On the completeness of bounded model checking for threshold-based distributed algorithms: reachability, An efficient distributed algorithm for canonical labeling on directed split-stars, A topological treatment of early-deciding set-agreement, Towards a real-time distributed computing model, A necessary condition for Byzantine \(k\)-set agreement, Liveness of a mutex algorithm in a fair process algebra, Trace-based derivation of a scalable lock-free stack algorithm, Classifying rendezvous tasks of arbitrary dimension, Is VAT really single linkage in disguise?, Leader-following consensus of discrete-time multiagent systems with time-varying delay based on large delay theory, Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound, Self-stabilizing coloration in anonymous planar networks, Modularity for teams of I/O automata, Developing topology discovery in Event-B, On the round complexity of Byzantine agreement without initial set-up, Verification of multi-agent systems with public actions against strategy logic, Automated analysis of fault-tolerance in distributed systems, Anonymous meeting in networks, Byzantine gathering in networks, Global consensus for discrete-time multi-agent systems with input saturation constraints, On the robust synthesis of logical consensus algorithms for distributed intrusion detection, Nondeterministic modal interfaces, Rendezvous in networks in spite of delay faults, Dynamic input/output automata: a formal and compositional model for dynamic systems, Synchronous condition-based consensus, The Theta-Model: achieving synchrony without clocks, The Heard-Of model: computing in distributed systems with benign faults, Causing communication closure: safe program composition with reliable non-FIFO channels, Maximum throughput of multiple access channels in adversarial environments, Consensus and collision detectors in radio networks, Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos, On the interconnection of message passing systems, A synchronous \(\pi\)-calculus, Two absolute bounds for distributed bit complexity, Centralized asynchronous broadcast in radio networks, Long-lived RAMBO: trading knowledge for communication, Speedup of Vidyasankar's algorithm for the group \(k\)-exclusion problem, Fast non-blocking atomic commit: an inherent trade-off, Tractable low-delay atomic memory, Optimal extension protocols for Byzantine broadcast and agreement, On temporal graph exploration, Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time, Byzantine-resilient distributed state estimation: a min-switching approach, Secure consensus with distributed detection via two-hop communication, Resilient consensus of second-order agent networks: asynchronous update rules with delays, Resilient coordinated movement of connected autonomous vehicles, A linear-time branching-time perspective on interface automata, Randomized transmission protocols for protection against jamming attacks in multi-agent consensus, On the radius of nonsplit graphs and information dissemination in dynamic networks, RHC-based consensus of multi-agent systems with simultaneous packet dropout and input delay, Algorand: a secure and efficient distributed ledger, A Paxos based algorithm to minimize the overhead of process recovery in consensus, Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis, A trace-based service semantics guaranteeing deadlock freedom, Network flows that solve least squares for linear equations, Self-stabilizing gathering of mobile robots under crash or Byzantine faults, Leader election in well-connected graphs, On the communication efficiency of statistically secure asynchronous MPC with optimal resilience, Convergence and stability analysis for iterative dynamics with application to compartmental networks: a trajectory distance based Lyapunov approach, Bankrupting Sybil despite churn, Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic, Adaptive consensus for uncertain multi-agent systems with stochastic measurement noises, Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks, Locality and checkability in wait-free computing, Optimal strategies for selecting coordinators, Time-efficient read/write register in crash-prone asynchronous message-passing systems, Anomalies and similarities among consensus numbers of variously-relaxed queues, Instability behaviour of heterogeneous multimedia networks under dynamic adversarial attacks, Polynomial hierarchy graph properties in hybrid logic, The distributed breakout algorithms, Adopt: asynchronous distributed constraint optimization with quality guarantees, Data flow analysis of asynchronous systems using infinite abstract domains, Eliminating message counters in synchronous threshold automata, The reactive simulatability (RSIM) framework for asynchronous systems, Tutorial on separation results in process calculi via leader election problems, Consensus in anonymous asynchronous systems with crash-recovery and omission failures, Gathering asynchronous oblivious mobile robots in a ring, Symmetric electoral systems for ambient calculi, Sparse covers for planar graphs and graphs that exclude a fixed minor, Asynchronous Byzantine agreement with optimal resilience, Reconciling fault-tolerant distributed algorithms and real-time computing, Efficient algorithms for anonymous Byzantine agreement, Unifying simulatability definitions in cryptographic systems under different timing assumptions, Distributed formation control of networked Euler-Lagrange systems with fault diagnosis, Fairness of components in system computations, Partially dynamic efficient algorithms for distributed shortest paths, Algebraic topology and concurrency, Fairness of actions in system computations, Bisimulation on speed: a unified approach, Fast linear iterations for distributed averaging, Capacitated automata and systems, Relative tempo of distributed averaging on networks, Distributed decision-making algorithms with multiple manipulative actors, Request-based token passing for self-stabilizing mutual exclusion, Global synchronization and consensus using beeps in a fault-prone multiple access channel, Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects, Error-pruning in interface automata, Message lower bounds via efficient network synchronization, Stability of Multi-Valued Continuous Consensus11Preliminary Version, Some proofs are omitted from this version., The Complexity of Early Deciding Set Agreement: How can Topology help?, An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems, Partial component consensus of discrete-time multiagent systems, A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring, Event-based control for average consensus of wireless sensor networks with stochastic communication noises, The evolution of non-degenerate and degenerate rendezvous tasks, Defending non-Bayesian learning against adversarial attacks, How Many Cooks Spoil the Soup?, Climate inference on daily rainfall across the Australian continent, 1876--2015, Group search of the plane with faulty robots, Static decentralized control of a single-integrator network with Markovian sensing topology, Safe and stabilizing distributed multi-path cellular flows, Distributed computation in dynamic networks via random walks, A characterization of oblivious message adversaries for which consensus is solvable, Denotational fixed-point semantics for constructive scheduling of synchronous concurrency, Specification and verification of concurrent programs through refinements, Distributed agreement in dynamic peer-to-peer networks, Decentralized sweep coverage algorithm for multi-agent systems with workload uncertainties, Two-process synchronization, Parallel and Distributed Algorithms in P Systems, Advanced concurrency control in Java, Computing Parameterized Invariants of Parameterized Petri Nets, Critical Density Thresholds in Distributed Wireless Networks, Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms, Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks, WONDER: Weighted one-shot distributed ridge regression in high dimensions, Unnamed Item, Global Synchronization of Pulse-Coupled Oscillators on Trees, Model Checking Probabilistic Systems, Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults, Unnamed Item, Optimal rendezvous on a line by location-aware robots in the presence of spies*, What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms, A Normalized Form for FIFO Protocols Traces, Application to the Replay of Mode-based Protocols, Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority, Stability in Heterogeneous Dynamic Multimedia Networks, Beyond Lamport's Happened-before, Tight Bounds for Asynchronous Renaming, Model Checking Linear-Time Properties of Probabilistic Systems, Distributed Average Consensus in Digraphs, Reach a nonlinear consensus for MAS via doubly stochastic quadratic operators, Synthesis of distributed algorithms with parameterized threshold guards, An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values, A Simple Object that Spans the Whole Consensus Hierarchy, Hybrid Multirate PALS, A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures, TIME-DELAY ROBUSTNESS OF CONSENSUS PROBLEMS IN REGULAR AND COMPLEX NETWORKS, Putting logic-based distributed systems on stable grounds, Assertion-Based Proof Checking of Chang-Roberts Leader Election in PVS, Unnamed Item, Active vibration control of structures using a leader–follower-based consensus design, Placement Inference for a Client-Server Calculus, From Algebraic Graph Transformation to Adhesive HLR Categories and Systems, Revising the Membrane Computing Model for Byzantine Agreement, Unnamed Item, Quantum dice rolling: a multi-outcome generalization of quantum coin flipping, Transition scale-spaces: A computational theory for the discretized entorhinal cortex, Distributed Graph Algorithms and their Complexity: An Introduction, How to Solve Consensus in the Smallest Window of Synchrony, Constant-Space Localized Byzantine Consensus, Optimistic Erasure-Coded Distributed Storage, On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory, Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study, Asynchronous group mutual exclusion, Making Asynchronous Distributed Computations Robust to Channel Noise, The BG distributed simulation algorithm, Randomized two-process wait-free test-and-set, The congenial talking philosophers problem in computer networks, Hundreds of impossibility results for distributed computing, Appraising two decades of distributed computing theory research, Safety assurance via on-line monitoring, Condition-based consensus solvability: a hierarchy of conditions and efficient protocols, Randomized Dining Philosophers without Fairness Assumption, Better Upper Bounds for Searching on a Line with Byzantine Robots, A High-Level Language for Modeling Algorithms and Their Properties, Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks, A HIERARCHICAL MODEL FOR DISTRIBUTED COLLABORATIVE COMPUTATION IN WIRELESS SENSOR NETWORKS, Turing Machines, Transition Systems, and Interaction, Formal Model–Driven Design of Distributed Algorithms, Regular Model Checking using Widening Techniques, Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms, How to meet asynchronously at polynomial cost, A Logical Approach to Hamiltonian Graphs, Light-Weight SMT-based Model Checking, On Synchronous and Asynchronous Interaction in Distributed Systems, Deterministic Models of Communication Faults, Dynamo: design, implementation, and evaluation of cooperative persistent object management in a local area network, Unnamed Item, Developing Topology Discovery in Event-B, Unnamed Item, The k-Observer Problem on d-regular Graphs, Temporal Verification of Fault-Tolerant Protocols, Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults, Generalized Universality, Fault-Tolerant Consensus with an Abstract MAC Layer., Locality and Checkability in Wait-Free Computing, Byzantine Agreement Using Partial Authentication, Fast Multidimensional Asymptotic and Approximate Consensus, Unnamed Item, Teams of pushdown automata, A Reduction Theorem for the Verification of Round-Based Distributed Algorithms, Message Lower Bounds via Efficient Network Synchronization, Recent Results on Fault-Tolerant Consensus in Message-Passing Networks, Graphs and Algorithms in Communication Networks on Seven League Boots, On the Runtime of Universal Coating for Programmable Matter, A Behavioural Theory of Recursive Algorithms, Authenticated Byzantine Generals in Dual Failure Model, An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract), FAST BROADCASTING WITH BYZANTINE FAULTS, Back to the Coordinated Attack Problem, Consensus in Networks of Discrete-Time Multi-agent Systems: Dynamical Topologies and Delays, Bounded Model Checking with Parametric Data Structures, Consistency verification in transaction-based optimistic steering of distributed computations, Modal Expressiveness of Graph Properties, A Characterization of Dynamic Networks Where Consensus Is Solvable, Stochastic Modelling of Communication Protocols from Source Code, A Calculus for Team Automata, Collaborative consensus tracking of heterogeneous group systems with switching topologies and input time delay, Computational Probabilistic Non-interference