Decidability of Parameterized Verification

DOI10.2200/S00658ED1V01Y201508DCT013zbMath1400.68006OpenAlexW1918351269MaRDI QIDQ4568312

No author found.

Publication date: 19 June 2018

Published in: Synthesis Lectures on Distributed Computing Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2200/s00658ed1v01y201508dct013

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (35)

A case study on parametric verification of failure detectors ⋮ Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker ⋮ A counter abstraction technique for verifying properties of probabilistic swarm systems ⋮ Structural Invariants for the Verification of Systems with Parameterized Architectures ⋮ Computing Parameterized Invariants of Parameterized Petri Nets ⋮ Parameterized model checking of rendezvous systems ⋮ Model Checking Parameterized Systems ⋮ What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms ⋮ Synthesis of large dynamic concurrent programs from dynamic specifications ⋮ Advances in parameterized verification of population protocols ⋮ Synthesis of distributed algorithms with parameterized threshold guards ⋮ Emptiness problems for distributed automata ⋮ Liveness in broadcast networks ⋮ Modelling Uncertainty in Architectures of Parametric Component-Based Systems ⋮ Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy ⋮ \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms ⋮ A methodology to take credit for high-level verification during RTL verification ⋮ Verification of SMT systems with quantifiers ⋮ Unnamed Item ⋮ The polynomial complexity of vector addition systems with states ⋮ Verification of component-based systems with recursive architectures ⋮ Finding cut-offs in leaderless rendez-vous protocols is easy ⋮ Long-Run Average Behavior of Vector Addition Systems with States ⋮ Reachability in Parameterized Systems: All Flavors of Threshold Automata ⋮ Parameterized model checking of networks of timed automata with Boolean guards ⋮ Checking deadlock-freedom of parametric component-based systems ⋮ The complexity of verifying population protocols ⋮ On the completeness of bounded model checking for threshold-based distributed algorithms: reachability ⋮ Model Checking Parameterised Multi-token Systems via the Composition Method ⋮ Structural Place Invariants for Analyzing the Behavioral Properties of Nested Petri Nets ⋮ Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States ⋮ Book review of: E. M. Clarke (ed.) et al., Handbook of model checking ⋮ Declarative Parameterized Verification of Distributed Protocols via the Cubicle Model Checker ⋮ Decision problems in a logic for reasoning about reconfigurable distributed systems ⋮ Computing parameterized invariants of parameterized Petri nets

This page was built for publication: Decidability of Parameterized Verification