Fair termination revisited - with delay

DOI10.1016/0304-3975(84)90103-8zbMATH Open0542.68015OpenAlexW2143417417MaRDI QIDQ795499FDOQ795499

Authors: Amir Pnueli, Jonathan Stavi, Krzysztof R. Apt 

Publication date: 1984

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90103-8

Recommendations

• scientific article; zbMATH DE number 3846836
• Probabilistic termination versus fair termination
• scientific article; zbMATH DE number 3965428
• A fixpoint approach to finite delay and fairness
• Fair termination is decidable for ground systems
• Fair termination for parameterized probabilistic concurrent systems
• Termination of Fair Computations in Term Rewriting
• Simple termination revisited
• Termination of just/fair computations in term rewriting

zbMATH Keywords

total correctnessnondeterministic programsconcurrent programsfair terminationproof method

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Cites Work

• Title not available (Why is that?)
• An axiomatic basis for computer programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• An axiomatic proof technique for parallel programs
• Programming as a Discipline of Mathematical Nature
• Title not available (Why is that?)
• Proof rules and transformations dealing with fairness
• Title not available (Why is that?)
• Axiomatic approach to total correctness of programs

Cited In (17)

• A complete rule for equifair termination
• Complete proof rules for strong fairness and strong extreme fairness
• Deadlock and fairness in morphisms of transition systems
• Infinite trees, markings, and well-foundedness
• Fifty years of Hoare's logic
• Temporal predicate transformers and fair termination
• Verification of concurrent programs: The automata-theoretic framework
• Liminf progress measures
• Fairness and Correctness in Case of a Premature Abort
• Fair termination is decidable for ground systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Semantic models for total correctness and fairness
• The \(\mu\)-calculus as an assertion-language for fairness arguments
• Communicating processes, scheduling, and the complexity of nontermination
• A methodology for designing proof rules for fair parallel programs

This page was built for publication: Fair termination revisited - with delay

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795499)