Conference item icon

Conference item

On the decidability of reachability in linear time-invariant systems

Abstract:

We consider the decidability of state-to-state reachability in linear time-invariant control systems over discrete time. We analyse this problem with respect to the allowable control sets, which in general are assumed to be defined by boolean combinations of linear inequalities. Decidability of the version of the reachability problem in which control sets are affine subspaces of Rn is a fundamental result in control theory. Our first result is that reachability is undecidable if the set of co...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1145/3302504.3311796

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Oxford college:
St John's College
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Role:
Author
Publisher:
Association for Computing Machinery Publisher's website
Journal:
HSCC 2019 Journal website
Pages:
77-86
Host title:
HSCC 2019
Publication date:
2019-04-16
Acceptance date:
2018-12-22
DOI:
Source identifiers:
983521
ISBN:
9781450362825
Pubs id:
pubs:983521
UUID:
uuid:b7b49746-ae7f-4dc9-b2b5-713f6bd3429a
Local pid:
pubs:983521
Deposit date:
2019-03-20

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP