Infinite trees, markings, and well-foundedness (Q1112586): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Proof rules and transformations dealing with fairness / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fair termination revisited - with delay / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3732949 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3738540 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A complete rule for equifair termination / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A proof rule for fair termination of guarded commands / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3922147 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3347267 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Verification of concurrent programs: The automata-theoretic framework / rank | |||
Normal rank | |||
Latest revision as of 10:12, 19 June 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
