Infinite trees, markings, and well-foundedness
type: Item
instance of: scholarly article
title: Infinite trees, markings, and well-foundedness
zbMATH Open document ID: 0659.68021
DOI: 10.1016/0890-5401(88)90035-1
author: Ran Rinat
author: Nissim Francez
author: Orna Grumberg
published in: Information and Computation
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 4078764
zbMATH Keywords: well-foundedness
zbMATH Keywords: computation tree
zbMATH Keywords: proof rule
zbMATH Keywords: fair termination
zbMATH Keywords: nondeterministic programs
MaRDI profile type: Publication
full work available at URL: 0890-5401(88)90035-1
OpenAlex ID: W1974312771
cites work: Proof rules and transformations dealing with fairness
cites work: Fair termination revisited - with delay
cites work: Q3732949
cites work: Q3738540
cites work: A complete rule for equifair termination
cites work: A proof rule for fair termination of guarded commands
cites work: Q3922147
cites work: Q3347267
cites work: Verification of concurrent programs: The automata-theoretic framework
description: scientific article; zbMATH DE number 4078764