Reachability Problems

丛 书 名：Lecture Notes in Computer Science

版本说明：1

作     者：Igor Potapov Pierre-Alain Reynier 

I S B N：(纸本) 9783030002497 

出 版 社：Springer Cham 

出 版 年：1000年

页      数：XXI, 161页

主 题 词：Logics and Meanings of Programs Numeric Computing Math Applications in Computer Science Probability and Statistics in Computer Science 

摘      要：This book constitutes the refereed proceedings of the 12th International Conference on Reachability Problems, RP 2018, held in Marseille, France, in September 2018.;The 11 full papers presented were carefully reviewed and selected from 21 submissions. The papers cover topics such as reachability for infinite 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.