Proving liveness of fair transition systems

DOI10.1007/BFB0105398zbMATH Open1540.68148MaRDI QIDQ6567705FDOQ6567705

Authors: Holger Busch 

Publication date: 5 July 2024

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Rule-based induction
• Title not available (Why is that?)

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)