Analyzing Guarded Protocols: Better Cutoffs, More Systems, More Expressivity
| Autor: | Swen Jacobs, Mouhammad Sakr |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Theoretical computer science
010201 computation theory & mathematics Computer science 0202 electrical engineering electronic engineering information engineering Parameterized complexity Cutoff 020201 artificial intelligence & image processing Scale (descriptive set theory) 0102 computer and information sciences 02 engineering and technology Expressivity (genetics) Type (model theory) 01 natural sciences |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783319737201 VMCAI |
| DOI: | 10.1007/978-3-319-73721-8_12 |
| Popis: | We study cutoff results for parameterized verification and synthesis of guarded protocols, as introduced by Emerson and Kahlon (2000). Guarded protocols describe systems of processes whose transitions are enabled or disabled depending on the existence of other processes in certain local states. Cutoff results reduce reasoning about systems with an arbitrary number of processes to systems of a determined, fixed size. Our work is based on the observation that existing cutoff results for guarded protocols are often impractical, since they scale linearly in the number of local states of processes in the system. We provide new cutoffs that scale not with the number of local states, but with the number of guards in the system, which is in many cases much smaller. Furthermore, we consider generalizations of the type of guards and of the specifications under consideration, and present results for problems that have not been known to admit cutoffs before. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|