Unboundedness detection for a class of communicating finite-state machines (Q1054479)
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: Unboundedness detection for a class of communicating finite-state machines |
scientific article; zbMATH DE number 3823153
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unboundedness detection for a class of communicating finite-state machines |
scientific article; zbMATH DE number 3823153 |
Statements
Unboundedness detection for a class of communicating finite-state machines (English)
0 references
1983
0 references
communicating finite-state machines
0 references
algorithm
0 references
reachability tree
0 references
communication protocols
0 references
deadlock detection
0 references
unboundedness detection
0 references
