Analyzing Guarded Protocols: Better Cutoffs, More Systems, More Expressivity

DOI10.1007/978-3-319-73721-8_12zbMath1446.68105arXiv1707.01369OpenAlexW2724095852MaRDI QIDQ3296331

Mouhammad Sakr, Swen Jacobs

Publication date: 7 July 2020

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

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

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)

Related Items (6)

Structural Invariants for the Verification of Systems with Parameterized Architectures ⋮ Computing Parameterized Invariants of Parameterized Petri Nets ⋮ Parameterized model checking of networks of timed automata with Boolean guards ⋮ 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: Analyzing Guarded Protocols: Better Cutoffs, More Systems, More Expressivity