Thông tin tài liệu
Thông tin siêu dữ liệu biểu ghi
| Trường DC | Giá trị | Ngôn ngữ |
|---|---|---|
| dc.contributor.author | Stefan, Göller | - |
| dc.contributor.author | Mathieu, Hilaire | - |
| dc.date.accessioned | 2023-04-27T08:03:45Z | - |
| dc.date.available | 2023-04-27T08:03:45Z | - |
| dc.date.issued | 2023 | - |
| dc.identifier.uri | https://link.springer.com/article/10.1007/s00224-023-10121-3 | - |
| dc.identifier.uri | https://dlib.phenikaa-uni.edu.vn/handle/PNK/8362 | - |
| dc.description | CC BY | vi |
| dc.description.abstract | Parametric timed automata (PTA) have been introduced by Alur, Henzinger, and Vardi as an extension of timed automata in which clocks can be compared against parameters. The reachability problem asks for the existence of an assignment of the parameters to the non-negative integers such that reachability holds in the underlying timed automaton. The reachability problem for PTA is long known to be undecidable, already over three parametric clocks. A few years ago, Bundala and Ouaknine proved that for PTA over two parametric clocks and one parameter the reachability problem is decidable and also showed a lower bound for the complexity class PSPACENEXP. | vi |
| dc.language.iso | en | vi |
| dc.publisher | Springer | vi |
| dc.subject | PTA | vi |
| dc.subject | PSPACENEXP | vi |
| dc.title | Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete | vi |
| dc.type | Book | vi |
| Bộ sưu tập | OER - Công nghệ thông tin | |
Danh sách tệp tin đính kèm:
