Unboundedness detection for a class of communicating finite-state machines (Q1054479): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(83)90105-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1990154918 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Deadlock Detection for a Class of Communicating Finite State Machines / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:16, 14 June 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
