株式会社極東書店トップ ＞ 商品一覧 ＞ Reachability Problems: 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings. 1st ed. 2017
商品詳細
Reachability Problems: 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings. 1st ed. 2017
・ISBN 978-3-319-67088-1 paper EUR 49.99
￥13,361.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Hague, Matthew / Potapov, Igor (eds.), |
|---|---|
| シリーズ | (Lecture Notes in Computer Science) |
| 出版社 | (Springer International Publishing AG, SZ) |
| 出版年月 | 2017 |
| ページ数 | 193 pp. |
| 言語 | ENG |
| ニュース番号 | ＜A01-76862＞ |
解説
This book constitutes the refereed proceedings of the 11th International Workshop on Reachability Problems, RP 2017, held in London, UK, in September 2017. The 12 full papers presented together with 1 invited paper were carefully reviewed and selected from 17 submissions.
The aim of the conference is to bring together scholars from diverse fields with a shared interest in reachability problems, and to promote the exploration of new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques. Topics of interest include (but are not limited to): reachability for innite state systems; rewriting systems; reachability analysis in counter/timed/cellular/communicating automata; Petri nets; computational aspects of semigroups, groups, and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps, and new computational paradigms.
The aim of the conference is to bring together scholars from diverse fields with a shared interest in reachability problems, and to promote the exploration of new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques. Topics of interest include (but are not limited to): reachability for innite state systems; rewriting systems; reachability analysis in counter/timed/cellular/communicating automata; Petri nets; computational aspects of semigroups, groups, and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps, and new computational paradigms.