Institutional Repository
| improvements for the symbolic verification of timed automata | |
| Yan Rongjie; Li Guangyuan; Zhang Wenliang; Peng Yunquan | |
| 2007 | |
| Conference Name | 27th International Conference on Formal Techniques for Networked and Distributed Systems |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 196-210 |
| Conference Date | JUN 27-29, |
| Conference Place | Tallinn, ESTONIA |
| Publish Place | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| Publisher | FORMAL TECHNIQUES FOR NETWORKED AND DISTRIBUTED SYSTEMS - FORTE 2007 |
| ISSN | 0302-9743 |
| ISBN | 978-3-540-73195-5 |
| Department | Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China. |
| English Abstract | Based on the equivalence relation for location based reachability between continuous and integer semantics of closed timed automata, Beyer et al. have implemented the verifier Rabbit, with the uniform representation of reachable configurations |
| Keyword | Verification Timed Systems Symbolic Method Bdd |
| Sponsorship | IFIP WG6 1, Tallinn Univ Technol, Dept Comp Sci, Tallinn Univ Technol, Inst Cybernet |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/10842 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation GB/T 7714 | Yan Rongjie,Li Guangyuan,Zhang Wenliang,et al. improvements for the symbolic verification of timed automata[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:FORMAL TECHNIQUES FOR NETWORKED AND DISTRIBUTED SYSTEMS - FORTE 2007,2007:196-210. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| improvements for the（253KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment