On the Complexity of the Escape Problem for Linear Dynamical Systems over 
Compact Semialgebraic Sets

D'Costa, Julian; Lefaucheux, Engel; Neumann, Eike; Ouaknine, Joël; Worrell, James

doi:10.4230/LIPIcs.MFCS.2021.33

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets

MPS-Authors

/persons/resource/persons245917

Lefaucheux, Engel
Group J. Ouaknine, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons265511

Neumann, Eike
Group J. Ouaknine, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons217847

Ouaknine, Joël
Group J. Ouaknine, Max Planck Institute for Software Systems, Max Planck Society;

External Resource

https://drops.dagstuhl.de/opus/volltexte/2021/14473/
(Publisher version)

https://creativecommons.org/licenses/by/4.0/legalcode
(Copyright transfer agreement)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

LIPIcs-MFCS-2021-33-1.pdf
(Publisher version), 713KB

Supplementary Material (public)

There is no public supplementary material available

Citation

D'Costa, J., Lefaucheux, E., Neumann, E., Ouaknine, J., & Worrell, J. (2021). On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets. In F. Bonchi, & S. J. Puglisi (Eds.), 46th International Symposium on Mathematical Foundations of Computer Science (pp. 1-21). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.MFCS.2021.33.

Cite as: https://hdl.handle.net/21.11116/0000-0009-2ECD-E

Abstract

There is no abstract available