Temporal predicate transformers and fair termination

DOI10.1007/BF00264610MaRDI QIDQ1120264zbMATH OpenFDO

Authors Joseph M. Morris

Publication date 1990

Published in Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

nondeterministic programspredicate transformer semanticsfairly- terminating programs

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 3965428
• scientific article; zbMATH DE number 3846836
• Fair termination revisited - with delay
• Semantic models for total correctness and fairness
• Probabilistic termination versus fair termination

Cited in

(12)

• An algebraic approach to refinement with fair choice
• Safety and progress of recursive procedures
• scientific article; zbMATH DE number 1612489 (Why is no real title available?)
• Weakest preconditions for progress
• Fairness and the axioms of control predicates
• Demonic, angelic and unbounded probabilistic choices in sequential programs
• scientific article; zbMATH DE number 3846836 (Why is no real title available?)
• scientific article; zbMATH DE number 3965428 (Why is no real title available?)
• scientific article; zbMATH DE number 3890707 (Why is no real title available?)
• On the Expressiveness of MTL Variants over Dense Time
• Semantic models for total correctness and fairness
• The \(\mu\)-calculus as an assertion-language for fairness arguments

This page was built for publication: Temporal predicate transformers and fair termination

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