Fair termination is decidable for ground systems

DOI10.1007/3-540-51081-8_126MaRDI QIDQ5055739zbMATH OpenOpenAlexFDO

Authors Sophie Tison

Publication date 9 December 2022

Published in Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-51081-8_126

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 3921985
• On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
• Termination of Fair Computations in Term Rewriting
• Termination of just/fair computations in term rewriting
• Fair termination revisited - with delay

Cites work

• Bottom-up and top-down tree transformations— a comparison
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• Tree generating regular systems

Cited in

(6)

• Conditional rewriting logic as a unified model of concurrency
• scientific article; zbMATH DE number 1617329 (Why is no real title available?)
• Termination Problems in Chemical Kinetics
• Fair termination revisited - with delay
• Termination of just/fair computations in term rewriting
• Verification of well-formed communicating recursive state machines

This page was built for publication: Fair termination is decidable for ground systems

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