On the algorithmic unsolvability of some stability problems forhybrid systems
We define two stability problems for a class of hybrid systems containing asynchronous iterative processes and prove these problems are algorithmically unsolvable. Furthermore, we also show some reachability problems for asynchronous iterative processes are algorithmically unsolvable
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Published: |
2000
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/14227/1/14227_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14227/2/14227_2.doc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|