Time, clocks, and the ordering of events in a distributed system
From MaRDI portal
Publication:4157944
Cited in
(only showing first 100 items - show all)- Asynchronous distributed termination-parallel and symmetric solutions with echo algorithms
- Unifying stabilization and termination in message-passing systems
- Model checking concurrent programs
- Communication-based prevention of useless checkpoints in distributed computations
- Efficient dependency tracking for relevant events in concurrent systems
- Efficient communication induced checkpointing protocol for broadcast network-based distributed systems
- Impossibility of scalar clock-based communication-induced checkpointing protocols ensuring the RDT property
- A partial ordering semantics for CCS
- Flush primitives for asynchronous distributed systems
- Data race avoidance and replay scheme for developing and debugging parallel programs on distributed shared memory systems
- Simulating synchronous processors
- Modeling, analyzing and slicing periodic distributed computations
- A timeband framework for modelling real-time systems
- Reachability analysis on distributed executions
- An efficient implementation of vector clocks
- Algorithms for monitoring real-time properties
- A centralized and a decentralized method to automatically derive choreography-conforming web service systems
- Lower bounds for asynchronous consensus
- \(\operatorname{Log}^{\prime}\) version vector: logging version vectors concisely in dynamic replication
- Techniques and applications of computation slicing
- Distributed deadlock detection
- Overcoming heterogeneity and autonomy in multidatabase systems
- Interleaving set temporal logic
- Logical classification of distributed algorithms (Bakery algorithms as an example)
- A class of deadlock-free Maekawa-type algorithms for mutual exclusion in distributed systems
- A puzzle‐based material handling system for order picking
- Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems)
- On-the-fly analysis of distributed computations
- Global reproducibility through local control for distributed active objects
- Algebraic specification and proof of a distributed recovery algorithm
- Proof of correctness of Ressel's adopted algorithm
- An Undo Framework for P2P Collaborative Editing
- Concurrent common knowledge: Defining agreement for asynchronous systems
- Virtual time and virtual space
- Transactional memory
- The poset of infinitary traces
- Compositionality: ontology and mereology of domains. Some clarifying observations in the context of software engineering
- Asynchronous forward-checking for DisCSPs
- A denotational semantics for SPARC TSO
- A new fault-tolerant algorithm for clock synchronization
- On fairness notions in distributed systems. I: A characterization of implementability
- Concurrent histories: a basis for observing distributed systems
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
- Abstractions for fault-tolerant global computing
- Limiting behavior of 3-color excitable media on arbitrary graphs
- The asynchronous bounded-cycle model
- Formalization and correctness of the PALS architectural pattern for distributed real-time systems
- Self-stabilizing leader election in dynamic networks
- Efficient online algorithm for identifying useless states in distributed systems
- On set consensus numbers
- Causality in physics and computation
- Second-level algorithms, superrecursivity, and recovery problem in distributed systems
- Monitoring distributed real-time systems
- Hybrid concurrency control for abstract data types
- A compositional framework for fault tolerance by specification transformation
- Testing Distributed Systems Through Symbolic Model Checking
- A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
- Dissecting distributed coordination
- Boundedness, empty channel detection, and synchronization for communicating finite automata
- Asynchronous backtracking without adding links: a new member in the ABT family
- Asynchronous aggregation and consistency in distributed constraint satisfaction
- Parallel implementations of Brunotte's algorithm
- A hybrid distributed mutual exclusion algorithm for cluster-based systems
- Reasoning about layered message passing systems
- Point algebras for temporal reasoning: Algorithms and complexity
- Wait-free implementations in message-passing systems
- Asynchronous networks and event driven dynamics
- A multi-cycle checkpointing protocol that ensures strict 1-rollback
- Analysis of a clock synchronization protocol for wireless sensor networks
- Causal behaviours and nets
- Domain theory for concurrency
- A survey of challenges for runtime verification from advanced application domains (beyond software)
- Timed-pNets: a communication behavioural semantic model for distributed systems
- Practically-self-stabilizing virtual synchrony
- An assertional proof of Rana's algorithm
- On the Inherent Cost of Atomic Broadcast and Multicast in Wide Area Networks
- Full simulation coverage for SystemC transaction-level models of systems-on-a-chip
- Safe termination detection in an asynchronous distributed system when processes may crash and recover
- Intractability results in predicate detection
- Towards a real-time distributed computing model
- A functional model for describing and reasoning about time behaviour of computing systems
- Active disk Paxos with infinitely many processes
- Low-latency atomic broadcast in the presence of contention
- The weakest failure detector to solve nonuniform consensus
- Timestamping messages and events in a distributed system using synchronous communication
- Strong eventual consistency of the collaborative editing framework WOOT
- Checking robustness between weak transactional consistency models
- Serializability theory for replicated databases
- On-line computations of the ideal lattice of posets
- Calculs approchés de la borne inférieure de valeurs réparties
- Clairvoyant state machine replication
- Fault tolerance in distributed systems using fused state machines
- Partition consistency. A case study in modeling systems with weak memory consistency and proving correctness of their implementations
- The Bancomat problem: An example of resource allocation in a partitionable asynchronous system
- Search for places for creation of consistent checkpoints in parallel programs by analyzing the program trace
- Semantic models of a timed distributed dataspace architecture
- Recording distributed snapshots based on causal order of message delivery
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
- Weak-order extensions of an order.
- An asynchronous message-passing distributed algorithm for the generalized local critical section problem
This page was built for publication: Time, clocks, and the ordering of events in a distributed system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4157944)
