Unboundedness detection for a class of communicating finite-state machines (Q1054479): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:09, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unboundedness detection for a class of communicating finite-state machines |
scientific article |
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
