Probabilistic termination versus fair termination

DOI10.1016/0304-3975(89)90158-8zbMath0679.68028OpenAlexW1980608699MaRDI QIDQ1822937

Michael Tiomkin

Publication date: 1989

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

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

zbMATH Keywords

fairnessprobabilistic programstermination of concurrent programs

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25)

Related Items (2)

On the Hardness of Almost–Sure Termination ⋮ On the hardness of analyzing probabilistic programs

Cites Work

• Propositional dynamic logic with local assignments
• A proof rule for fair termination of guarded commands
• Guarded commands, nondeterminacy and formal derivation of programs
• Termination of Probabilistic Concurrent Program
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Probabilistic termination versus fair termination