The Discrete Time Behaviour of Restricted Linear Hybrid Automata
| dc.contributor.author | AGRAWAL, Manindra | en_US |
| dc.contributor.author | STEPHAN, Frank | en_US |
| dc.contributor.author | THIAGARAJAN, P. S. | en_US |
| dc.contributor.author | YANG, Shaofa | en_US |
| dc.date.accessioned | 2008-12-15T01:59:32Z | en_US |
| dc.date.accessioned | 2017-01-23T07:00:09Z | |
| dc.date.available | 2008-12-15T01:59:32Z | en_US |
| dc.date.available | 2017-01-23T07:00:09Z | |
| dc.date.issued | 2008-12-15T01:59:32Z | en_US |
| dc.description.abstract | We summarize results from [2, 3, 1] on the discrete time behaviour of a class of restricted linear hybrid automata. Specifically, we show the regularity of the discrete time behaviour of hybrid automata in which the rates of continuous vari- ables are governed by linear operators in a diagonal form and in which the values of the continuous variables can be observed only with finite precision. Crucially, we do not demand—as is usually done—that the values of the continuous vari- ables be reset during mode changes. We can cope with polynomial guards and we can tolerate bounded delays both in sampling the values of the continuous variables and in effecting changes in their rates required by mode switchings. We also show that if the rates are governed by diagonalizable linear operators with rational eigenvalues and there is no delay in effecting rate changes, the discrete time behaviour of the hybrid automaton is recursive. However, the control state reachability problem in this setting is undecidable. | en_US |
| dc.format.extent | 332316 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/2854 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TR12/08 | en_US |
| dc.title | The Discrete Time Behaviour of Restricted Linear Hybrid Automata | en_US |
| dc.type | Technical Report | en_US |