License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2021.3
URN: urn:nbn:de:0030-drops-134377
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/13437/
Schmitz, Sylvain
Branching in Well-Structured Transition Systems (Invited Talk)
Abstract
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.
BibTeX - Entry
@InProceedings{schmitz:LIPIcs:2021:13437,
author = {Sylvain Schmitz},
title = {{Branching in Well-Structured Transition Systems (Invited Talk)}},
booktitle = {29th EACSL Annual Conference on Computer Science Logic (CSL 2021)},
pages = {3:1--3:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-175-7},
ISSN = {1868-8969},
year = {2021},
volume = {183},
editor = {Christel Baier and Jean Goubault-Larrecq},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13437},
URN = {urn:nbn:de:0030-drops-134377},
doi = {10.4230/LIPIcs.CSL.2021.3},
annote = {Keywords: fast-growing complexity, well-structured transition system}
}
|
Keywords: |
|
fast-growing complexity, well-structured transition system |
|
Collection: |
|
29th EACSL Annual Conference on Computer Science Logic (CSL 2021) |
|
Issue Date: |
|
2021 |
|
Date of publication: |
|
13.01.2021 |
