Decidability and complexity for quiescent consistency and its variations
type: Item
instance of: scholarly article
title: Decidability and complexity for quiescent consistency and its variations
zbMATH Open document ID: 1380.68294
author: Brijesh Dongol
author: Robert M. Hierons
published in: Information and Computation
publication date: 2017-11-16T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 6807524
MaRDI profile type: Publication
full work available at URL: j.ic.2017.09.012
OpenAlex ID: W2964094199
cites work: Model-checking of correctness conditions for concurrent objects
cites work: How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
cites work: Q3713577
cites work: Abstraction for concurrent objects
cites work: Q3698316
cites work: Decidability and Complexity for Quiescent Consistency
cites work: Counting networks
cites work: Between Linearizability and Quiescent Consistency
cites work: The complexity of satisfiability problems
cites work: Characterizations of the decidability of some problems for regular trace languages
cites work: Q4601893
cites work: The complexity of equivalence problems for commutative grammars
cites work: A variant of a recursively unsolvable problem
cites work: Verifying Concurrent Programs against Sequential Specifications
cites work: Parameterised Linearisability
cites work: On verifying causal consistency
cites work: Quantitative relaxation of concurrent data structures
cites work: On reducing linearizability to state reachability
cites work: Tractable refinement checking for concurrent objects
DOI: 10.1016/J.IC.2017.09.012
Recommended article: Decidability and Complexity for Quiescent Consistency
Recommended article: Computability and decidability issues in the theory of consistency enforcement
Recommended article: On quasi-inconsistency and its complexity
Recommended article: The complexity of weak consistency
Recommended article: Between Linearizability and Quiescent Consistency
Recommended article: On the quantifier-free dynamic complexity of reachability
Recommended article: On the Quantifier-Free Dynamic Complexity of Reachability
Recommended article: Computing weak consistency in polynomial time (extended abstract)
Recommended article: On the complexity of verifying concurrent transition systems
description: scientific article; zbMATH DE number 6807524