Tight Cutoffs for Guarded Protocols with Fairness

DOI10.1007/978-3-662-49122-5_23zbMath1475.68175arXiv1505.03273OpenAlexW2267038783MaRDI QIDQ2796072

Swen Jacobs, Simon Außerlechner, Ayrat Khalimov

Publication date: 23 March 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.03273

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (7)

Structural Invariants for the Verification of Systems with Parameterized Architectures ⋮ Computing Parameterized Invariants of Parameterized Petri Nets ⋮ Parameterized model checking of rendezvous systems ⋮ Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms ⋮ Checking deadlock-freedom of parametric component-based systems ⋮ Parameterized synthesis of self-stabilizing protocols in symmetric networks ⋮ Computing parameterized invariants of parameterized Petri nets

This page was built for publication: Tight Cutoffs for Guarded Protocols with Fairness