Infinite trees, markings, and well-foundedness (Q1112586): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:22, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Infinite trees, markings, and well-foundedness |
scientific article |
Statements
Infinite trees, markings, and well-foundedness (English)
0 references
1988
0 references
Computations of nondeterministic programs are modelled by paths in trees. A necessary and sufficient condition is given for the existence of infinite paths in a (computation) tree. This yields a proof rule for fair termination and similar properties of nondeterministic programs.
0 references
well-foundedness
0 references
computation tree
0 references
proof rule
0 references
fair termination
0 references
nondeterministic programs
0 references
