Decidability and complexity results for verification of asynchronous broadcast networks (Q4910461)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decidability and complexity results for verification of asynchronous broadcast networks |
scientific article; zbMATH DE number 6145872
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decidability and complexity results for verification of asynchronous broadcast networks |
scientific article; zbMATH DE number 6145872 |
Statements
Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks (English)
0 references
18 March 2013
0 references
infinite-state systems
0 references
broadcast protocols
0 references
verification
0 references
0.8021689653396606
0 references
0.7728265523910522
0 references
0.7710527181625366
0 references
0.7668187618255615
0 references
