Undecidability Results for Hybrid Systems
| dc.contributor.author | Henzinger, Thomas A. | en_US |
| dc.contributor.author | Kopke, Peter W. | en_US |
| dc.date.accessioned | 2007-04-23T18:00:28Z | |
| dc.date.available | 2007-04-23T18:00:28Z | |
| dc.date.issued | 1995-02 | en_US |
| dc.description.abstract | We illuminate the boundary between decidability and undecidability for hybrid systems. Adding any of the following decorations to a timed automaton makes the reachability problem undecidable: 1. a single stopwatch with weak (less than or equal to, greater than or equal to) edge guards 2. a single skewed clock with variable equality tests 3. a single two-slope clock with weak edge guards 4. a single memory cell with weak edge guards As a corollary, we obtain undecidability for linear hybrid systems with triangular differential inclusions, which have invariants of the form x' less than or equal to y'. | en_US |
| dc.format.extent | 197449 bytes | |
| dc.format.extent | 223640 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR95-1483 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7142 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Undecidability Results for Hybrid Systems | en_US |
| dc.type | technical report | en_US |