English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We present an algorithm for the repair of parameterized systems. The repairproblem is, for a given process implementation, to find a refinement such thata given safety property is satisfied by the resulting parameterized system, anddeadlocks are avoided. Our algorithm uses a parameterized model checker todetermine the correctness of candidate solutions and employs a constraintsystem to rule out candidates. We apply this algorithm on systems that can berepresented as well-structured transition systems (WSTS), including disjunctivesystems, pairwise rendezvous systems, and broadcast protocols. Moreover, weshow that parameterized deadlock detection can be decided in EXPTIME fordisjunctive systems, and that deadlock detection is in general undecidable forbroadcast protocols.

Automatic Repair and Deadlock Detection for Parameterized Systems