| 書(shū)目名稱(chēng) | Reachability Problems |
| 副標(biāo)題 | 5th International Wo |
| 編輯 | Giorgio Delzanno,Igor Potapov |
| 視頻video | http://file.papertrans.cn/822/821815/821815.mp4 |
| 概述 | Up-to-date results.Fast-track conference proceedings.State-of-the-art research |
| 叢書(shū)名稱(chēng) | Lecture Notes in Computer Science |
| 圖書(shū)封面 |  |
| 描述 | This book constitutes the refereed proceedings of the 5th International Workshop on Reachability Problems, RP 2011, held in Genoa, Italy, in September 2011.The 16 papers presented together with 4 invited talks were carefully reviewed and selected from 24 submissions. The workshop deals with reachability problems that appear in algebraic structures, computational models, hybrid systems, logic, and verification. Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models like cellular automata and Petri nets, decision procedures for classical, modal and temporal logic, program analysis, discrete and continuous systems, time critical systems, and open systems modelled as games. |
| 出版日期 | Conference proceedings 2011 |
| 關(guān)鍵詞 | algorithms; cellular automata; computational complexity; real-time systems; timed automata; algorithm ana |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-24288-5 |
| isbn_softcover | 978-3-642-24287-8 |
| isbn_ebook | 978-3-642-24288-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag GmbH Berlin Heidelberg 2011 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-7 05:19
發(fā)表于 2025-3-21 16:30:03
