2026-07-22T01:18:18Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13437 2024-03-06T10:52:04Z ddc:004 open_access

Branching in Well-Structured Transition Systems (Invited Talk) Schmitz, Sylvain fast-growing complexity well-structured transition system The framework of well-structured transition systems has been highly successful in providing generic algorithms to show the decidability of verification problems for infinite-state systems. In some of these applications, the executions in the system at hand are actually trees, and need to be "lifted" to executions over sets of configurations in order to fit in the framework. The downside of this approach is that we might lose precision when analysing the computational complexity of the algorithms, compared to reasoning over branching executions. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Sylvain Schmitz 2021 Is Part Of LIPIcs, Volume 183, 29th EACSL Annual Conference on Computer Science Logic (CSL 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2021.3 urn:nbn:de:0030-drops-134377 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2021.3 eng https://creativecommons.org/licenses/by/3.0/legalcode