Complexity Bounds for Ordinal-Based Termination - (Invited Talk)

Sylvain Schmitz. Complexity Bounds for Ordinal-Based Termination - (Invited Talk). In Joël Ouaknine, Igor Potapov, James Worrell, editors, Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings. Volume 8762 of Lecture Notes in Computer Science, pages 1-19, Springer, 2014. [doi]

Abstract

Abstract is missing.