We review the characterization of communicating finite-state machines whose behaviors have universally or existentially bounded channels. These results rely on the theory of Mazurkiewicz traces. We investigate the question whether channel bound conditions are decidable for a given communicating finite-state machine.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:32730 |
| Date | 17 January 2019 |
| Creators | Genest, Blaise, Kuske, Dietrich, Muscholl, Anca |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/publishedVersion, doc-type:article, info:eu-repo/semantics/article, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | 0169-2968, 1875-8681 |
Page generated in 0.0232 seconds