Infinite trees, markings, and well-foundedness

DOI10.1016/0890-5401(88)90035-1zbMath0659.68021OpenAlexW1974312771MaRDI QIDQ1112586

Orna Grumberg, Ran Rinat, Nissim Francez

Publication date: 1988

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(88)90035-1

zbMATH Keywords

well-foundednessnondeterministic programsfair terminationcomputation treeproof rule

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Liminf progress measures, Verification of concurrent programs: The automata-theoretic framework

Cites Work

• Fair termination revisited - with delay
• Proof rules and transformations dealing with fairness
• A complete rule for equifair termination
• Verification of concurrent programs: The automata-theoretic framework
• A proof rule for fair termination of guarded commands
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item