Well-Structured Systems: Algorithms and Complexity

Philippe Schnoebelen
LSV / CNRS & ENS Cachan
Friday, 26 February, 2016 - 10:00
NO Solvay (5th floor)

Well-structured systems, aka WSTS, are a family of infinite-state computational models that support generic decidability results based on well-quasi-ordering theory. They have many applications in logics of programs and verification. In this talk we present a modern version of the basic WSTS algorithms and describe new techniques for the complexity analysis of WSTS models.