Liveness in broadcast networks

We study liveness and model checking problems for broadcast networks, a system model of identical clients communicating via message passing. The first problem that we consider is Liveness Verification . It asks whether there is a computation such that one clients visits a final state infinitely ofte...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computing Ročník 104; číslo 10; s. 2203 - 2223
Hlavní autoři: Chini, Peter, Meyer, Roland, Saivasan, Prakash
Médium: Journal Article
Jazyk:angličtina
Vydáno: Vienna Springer Vienna 01.10.2022
Springer Nature B.V
Témata:
Algorithms
Artificial Intelligence
Clients
Communication
Computation
Computer Appl. in Administrative Data Processing
Computer Communication Networks
Computer Science
Information Systems Applications (incl.Internet)
Iterative methods
Linear programming
Message passing
Networks
Polynomials
Software Engineering
Special Issue Article
Specifications
Temporal logic
Verification
Broadcast networks
Model checking
68Q45
Liveness verification
68Q17
ISSN:0010-485X, 1436-5057
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We study liveness and model checking problems for broadcast networks, a system model of identical clients communicating via message passing. The first problem that we consider is Liveness Verification . It asks whether there is a computation such that one clients visits a final state infinitely often. The complexity of the problem has been open. It was shown to be P -hard but in EXPSPACE . We close the gap by a polynomial-time algorithm. The latter relies on a characterization of live computations in terms of paths in a suitable graph, combined with a fixed-point iteration to efficiently check the existence of such paths. The second problem is Fair Liveness Verification . It asks for a computation where all participating clients visit a final state infinitely often. We adjust the algorithm to also solve fair liveness in polynomial time. Both problems can be instrumented to answer model checking questions for broadcast networks against linear time temporal logic specifications. The first problem in this context is Fair Model Checking . It demands that for all computations of a broadcast network, all participating clients satisfy the specification. We solve the problem via the Vardi–Wolper construction and a reduction to Liveness Verification . The second problem is Sparse Model Checking . It asks whether each computation has a participating client that satisfies the specification. We reduce the problem to Fair Liveness Verification .
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0010-485X
1436-5057
DOI:10.1007/s00607-021-00986-y