Time, clocks, and the ordering of events in a distributed system

Cites Work

Time, clocks, and the ordering of events in a distributed system

Cited In (only showing first 100 items - show all)

Timed-pNets: a communication behavioural semantic model for distributed systems
A partial ordering semantics for CCS
Flush primitives for asynchronous distributed systems
Virtual time and virtual space
The poset of infinitary traces
Concurrent histories: a basis for observing distributed systems
Model checking concurrent programs
Distributed deadlock detection
Hybrid concurrency control for abstract data types
Dissecting distributed coordination
Second-level algorithms, superrecursivity, and recovery problem in distributed systems
Monitoring distributed real-time systems
Asynchronous backtracking without adding links: a new member in the ABT family
Asynchronous aggregation and consistency in distributed constraint satisfaction
Lower bounds for asynchronous consensus
Techniques and applications of computation slicing
Logical classification of distributed algorithms (Bakery algorithms as an example)
A denotational semantics for SPARC TSO
Unifying stabilization and termination in message-passing systems
Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems)
Algebraic specification and proof of a distributed recovery algorithm
Concurrent common knowledge: Defining agreement for asynchronous systems
Abstractions for fault-tolerant global computing
Modeling, analyzing and slicing periodic distributed computations
Formalization and correctness of the PALS architectural pattern for distributed real-time systems
Domain theory for concurrency
An Undo Framework for P2P Collaborative Editing
A new fault-tolerant algorithm for clock synchronization
Boundedness, empty channel detection, and synchronization for communicating finite automata
The asynchronous bounded-cycle model
Self-stabilizing leader election in dynamic networks
A survey of challenges for runtime verification from advanced application domains (beyond software)
Simulating synchronous processors
On fairness notions in distributed systems. I: A characterization of implementability
Limiting behavior of 3-color excitable media on arbitrary graphs
Asynchronous networks and event driven dynamics
Asynchronous distributed termination-parallel and symmetric solutions with echo algorithms
On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
A compositional framework for fault tolerance by specification transformation
A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
Communication-based prevention of useless checkpoints in distributed computations
Overcoming heterogeneity and autonomy in multidatabase systems
Global reproducibility through local control for distributed active objects
Causality in physics and computation
A multi-cycle checkpointing protocol that ensures strict 1-rollback
Interleaving set temporal logic
Testing Distributed Systems Through Symbolic Model Checking
Impossibility of scalar clock-based communication-induced checkpointing protocols ensuring the RDT property
A class of deadlock-free Maekawa-type algorithms for mutual exclusion in distributed systems
A hybrid distributed mutual exclusion algorithm for cluster-based systems
Data race avoidance and replay scheme for developing and debugging parallel programs on distributed shared memory systems
A centralized and a decentralized method to automatically derive choreography-conforming web service systems
\(\operatorname{Log}^{\prime}\) version vector: logging version vectors concisely in dynamic replication
A puzzle‐based material handling system for order picking
Parallel implementations of Brunotte's algorithm
Reasoning about layered message passing systems
Analysis of a clock synchronization protocol for wireless sensor networks
Efficient communication induced checkpointing protocol for broadcast network-based distributed systems
An efficient implementation of vector clocks
Proof of correctness of Ressel's adopted algorithm
Compositionality: ontology and mereology of domains. Some clarifying observations in the context of software engineering
Asynchronous forward-checking for DisCSPs
Point algebras for temporal reasoning: Algorithms and complexity
Causal behaviours and nets
Reachability analysis on distributed executions
Efficient online algorithm for identifying useless states in distributed systems
On set consensus numbers
Efficient dependency tracking for relevant events in concurrent systems
A timeband framework for modelling real-time systems
Algorithms for monitoring real-time properties
Transactional memory
On-the-fly analysis of distributed computations
Wait-free implementations in message-passing systems
Applying relation algebra and RelView to solve problems on orders and lattices
Spanders: distributed spanning expanders
Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks
Time, clocks, and the ordering of events in a distributed system
\textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
Causal memory: definitions, implementation, and programming
Generalized Universality
Replicated abstract data types: building blocks for collaborative applications
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
Billiard quorums on the grid
Synchronous, asynchronous, and causally ordered communication
Symbolic predictive analysis for concurrent programs
\textsc{Ramos}: concurrent writing and reconfiguration for collaborative systems
Immediate detection of predicates in pervasive environments
From the happened-before relation to the causal ordered set abstraction
Info-based approach in distributed mutual exclusion algorithms
Approximating the buffer allocation problem using epochs
An optimistic checkpointing and message logging approach for consistent global checkpoint collection in distributed systems
Pronto: high availability for standard off-the-shelf databases
On termination detection in crash-prone distributed systems with failure detectors
On interprocess communication. I: Basic formalism
A limitation of vector timestamps for reconstructing distributed computations
On the time complexity of minimum and maximum global snapshot problems
Evaluations of domino-free communication-induced checkpointing protocols
Optimistic atomic broadcast: A pragmatic viewpoint
Computability and realizability for interactive computations
X-ability: a theory of replication

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)