Proving liveness of fair transition systems

DOI10.1007/BFB0105398MaRDI QIDQ6567705zbMATH OpenFDO

Authors Holger Busch

Publication date 5 July 2024

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• Proving Liveness by Backwards Reachability
• Frontiers of Combining Systems
• On the refinement of liveness properties of distributed systems
• scientific article; zbMATH DE number 177525
• scientific article; zbMATH DE number 177518

Cites work

• scientific article; zbMATH DE number 2185685 (Why is no real title available?)
• scientific article; zbMATH DE number 52748 (Why is no real title available?)
• scientific article; zbMATH DE number 194539 (Why is no real title available?)
• Rule-based induction

This page was built for publication: Proving liveness of fair transition systems

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