The following pages link to (Q3833630):
Displaying 50 items.
- Efficient test \& set constructions for faulty shared memory (Q287031) (← links)
- Mechanizing a process algebra for network protocols (Q287372) (← links)
- Compatibility in a multi-component environment (Q383353) (← links)
- Processes with infinite liveness requirements (Q383788) (← links)
- Solving the at-most-once problem with nearly optimal effectiveness (Q391254) (← links)
- An algebraic theory of interface automata (Q402131) (← links)
- Verification of distributed systems with local-global predicates (Q432134) (← links)
- Symbolic execution of Reo circuits using constraint automata (Q433344) (← links)
- Interrupting snapshots and the \(\text{Java}^{\text{TM}}\) size method (Q455960) (← links)
- Towards formally specifying and verifying transactional memory (Q470040) (← links)
- A coded shared atomic memory algorithm for message passing architectures (Q518683) (← links)
- Contexts, refinement and determinism (Q541213) (← links)
- Optimal deployment of eventually-serializable data services (Q545558) (← links)
- Partial order reduction for state/event LTL with application to component-interaction automata (Q549692) (← links)
- The impossibility of boosting distributed service resilience (Q550250) (← links)
- Metrics for labelled Markov processes (Q596029) (← links)
- Automata and processes on multisets of communicating objects (Q609033) (← links)
- Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects (Q633299) (← links)
- Information gain of black-box testing (Q640298) (← links)
- Closing the complexity gap between FCFS mutual exclusion and mutual exclusion (Q660999) (← links)
- A process algebraic view of input/output automata (Q674195) (← links)
- The impact of recovery on concurrency control (Q686645) (← links)
- Relational concurrent refinement. III: Traces, partial relations and automata (Q736917) (← links)
- Commutativity-based locking for nested transactions (Q753480) (← links)
- On the refinement of liveness properties of distributed systems (Q763239) (← links)
- Cones and foci: A mechanical framework for protocol verification (Q853730) (← links)
- Switched PIOA: parallel composition via distributed scheduling (Q854167) (← links)
- Dynamic load balancing with group communication (Q861278) (← links)
- Single-bit messages are insufficient for data link over duplicating channels (Q963455) (← links)
- Alternating-time stream logic for multi-agent systems (Q967523) (← links)
- Refined quorum systems (Q992512) (← links)
- Processes with local and global liveness requirements (Q1007234) (← links)
- Modularity for teams of I/O automata (Q1041819) (← links)
- A framework for viewing atomic events in distributed computations (Q1128710) (← links)
- Hybrid concurrency control for abstract data types (Q1176284) (← links)
- Distributed event algebras (Q1191023) (← links)
- Using mappings to prove timing properties (Q1200918) (← links)
- Counting protocols for reliable end-to-end transmission (Q1267718) (← links)
- Eventually-serializable data services (Q1292429) (← links)
- Linearizable read/write objects (Q1292436) (← links)
- Petri net based verification of distributed algorithms: An example (Q1377301) (← links)
- Formal verification of a leader election protocol in process algebra (Q1391796) (← links)
- Hybrid I/O automata. (Q1427865) (← links)
- Virtual partition algorithm in a nested transaction environment and its correctness (Q1602517) (← links)
- Generalized interface automata with multicast synchronization (Q1633060) (← links)
- Conditions of contracts for separating responsibilities in heterogeneous systems (Q1742989) (← links)
- Task-structured probabilistic I/O automata (Q1745718) (← links)
- Toward an algebraic theory of systems (Q1786609) (← links)
- Cooperative computing with fragmentable and mergeable groups (Q1827289) (← links)
- Trade-off results for connection management (Q1853581) (← links)
