Finding cut-offs in leaderless rendez-vous protocols is easy (Q2233393)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7410418
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding cut-offs in leaderless rendez-vous protocols is easy |
scientific article; zbMATH DE number 7410418 |
Statements
Finding cut-offs in leaderless rendez-vous protocols is easy (English)
0 references
18 October 2021
0 references
rendez-vous protocols
0 references
cut-off problem
0 references
Petri nets
0 references
0 references
0.99999976
0 references
0.80946153
0 references
0 references
0.79749084
0 references
