Complexity of Liveness in Parameterized Systems

@inproceedings{Chini2019ComplexityOL,
  title={Complexity of Liveness in Parameterized Systems},
  author={Peter Chini and Roland Meyer and Prakash Saivasan},
  booktitle={FSTTCS},
  year={2019}
}
We investigate the fine-grained complexity of liveness verification for leader contributor systems. These consist of a designated leader thread and an arbitrary number of identical contributor threads communicating via a shared memory. The liveness verification problem asks whether there is an infinite computation of the system in which the leader reaches a final state infinitely often. Like its reachability counterpart, the problem is known to be NP-complete. Our results show that, even from a… Expand
Safety Verification of Parameterized Systems under Release-Acquire
TLDR
The results are strong in that they delineate the tractability border for an established semantics and show that the complexity jumps to NEXPTIME-complete for thread-modular verification where an unrestricted distinguished ‘ego’ thread interacts with an environment of CAS-free threads plus loop-free distinguished threads. Expand
Liveness in Broadcast Networks
TLDR
A polynomial-time algorithm is used to solve liveness and model checking problems for broadcast networks, a system model of identical clients communicating via message passing, which demands that for all computations of a broadcast network, all participating clients satisfy the specification. Expand
Parameterized Complexity of Safety of Threshold Automata
TLDR
The parameterized complexity of reachability of threshold automata is studied and it is shown that the problem becomes W[1]-hard even when parameterized by parameters which are quite small in practice. Expand
A Framework for Consistency Algorithms
TLDR
The framework shows, that despite the hardness, fast deterministic consistency algorithms can be obtained by employing tools from fine-grained complexity, and shows that the obtained algorithms for SC, TSO, PSO, and PSO are optimal in the fine- grained sense. Expand
Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent (Long Version)
We show the equivalence of two distributed computing models, namely reconfigurable broadcast networks (RBN) and asynchronous shared-memory systems (ASMS), that were introduced independently. Both RBNExpand

References

SHOWING 1-10 OF 34 REFERENCES
Fine-Grained Complexity of Safety Verification
TLDR
Formally, it is shown that there is no polynomial kernel, no compression algorithm that reduces D or s to aPolynomial dependence on P and t, which indicates that symbolic methods may be harder to find for this problem. Expand
Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems
TLDR
It is shown that verification of general regular properties of traces of executions, satisfying some stuttering condition, is Nexptime-complete for this model of pushdown processes communicating via shared memory. Expand
Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable
TLDR
This work considers other formal models of concurrent systems with decidable safety problem and finds very liberal conditions on the individual processes under which the safety problem is decidable: the only substantial condition is the effective computability of the downward closure for the class of the leader processes. Expand
Model checking parameterized asynchronous shared-memory systems
TLDR
The problem is decidable, and has a surprisingly low complexity: it is NP-complete when all processes are finite-state machines, and is in NEXPTIME (and PSPACE-hard) when they are pushdown machines. Expand
Context-Bounded Model Checking of Concurrent Software
TLDR
This paper proves that the problem of verifying a concurrent boolean program is decidable, even in the presence of unbounded parallelism, if the analysis is restricted to executions in which the number of context switches is bounded by an arbitrary constant. Expand
On the Complexity of Bounded Context Switching
TLDR
A parameterized analysis of BCS and proves that BCS admits no polynomial kernel, and an algorithm that solves BCS when parameterized by the number of context switches and the size of the memory in O*(m^ (cs)2^(cs)). Expand
Parameterized Verification of Asynchronous Shared-Memory Systems
TLDR
This work describes the complexity of the safety verification problem for parameterized systems consisting of a leader process and arbitrarily many anonymous and identical contributors, and analyzes the complexity when processes are modeled by finite-state machines, pushdown machines, and Turing machines. Expand
Liveness in Broadcast Networks
TLDR
A polynomial-time algorithm is used to solve liveness and model checking problems for broadcast networks, a system model of identical clients communicating via message passing, which demands that for all computations of a broadcast network, all participating clients satisfy the specification. Expand
On Bounded Reachability Analysis of Shared Memory Systems
TLDR
This paper addresses the reachability problem for pushdown systems communicating via shared memory and proposes a restriction on the behaviours of such systems, called stage bound, towards decidability. Expand
Verifying programs with unreliable channels
  • P. Abdulla, B. Jonsson
  • Computer Science
  • [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science
  • 1993
TLDR
The verification of a particular class of infinite-state systems, namely, systems consisting of finite-state processes that communicate via unbounded lossy FIFO channels, is considered and it is shown that several interesting verification problems are decidable by giving algorithms for verifying. Expand
...
1
2
3
4
...