Fairness for Infinite-State Systems

DOI10.1007/978-3-662-46681-0_30MaRDI QIDQ5194957zbMATH OpenOpenAlexFDO

Authors Byron Cook, Heidy Khlaaf, Nir Piterman

Publication date 17 September 2019

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46681-0_30

zbMATH Keywords

model checkingcomputation tree logicTuring machinetransition systematomic proposition

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Fairness for infinitary control
• Proving the existence of fair paths in infinite-state systems
• Finitary fairness in action systems
• Fairness of actions in system computations
• On fairness of D0L systems
• Fairness in systems based on multiparty interactions
• Tools and Algorithms for the Construction and Analysis of Systems
• On complete primitives for fairness
• Defining fairness in reactive and concurrent systems

Cited in

(7)

• Automatic discovery of fair paths in infinite-state transition systems
• scientific article; zbMATH DE number 1834575 (Why is no real title available?)
• On automation of \(\mathsf{CTL}^*\) verification for infinite-state systems
• Tools and Algorithms for the Construction and Analysis of Systems
• Proving the existence of fair paths in infinite-state systems
• On fairness of D0L systems
• Temporal verification of programs via first-order fixpoint logic

This page was built for publication: Fairness for Infinite-State Systems

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