Reachability Problems - 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings (Paperback, 1st ed. 2021)

This book constitutes the refereed proceedings of the 15th International Conference on Reachability Problems, RP 2021, held in Liverpool, UK in October 2021. The 6 full papers presented were carefully reviewed and selected from 27 submissions. In addition, 4 invited papers were included in this volume. The RP proceedings 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. Chapter 'Recent Advances on Reachability Problems for Valence Systems' is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

General

Imprint:	Springer Nature Switzerland AG
Country of origin:	Switzerland
Series:	Lecture Notes in Computer Science, 13035
Release date:	October 2021
First published:	2021
Editors:	Paul C. Bell • Patrick Totzke • Igor Potapov
Dimensions:	235 x 155mm (L x W)
Format:	Paperback
Pages:	165
Edition:	1st ed. 2021
ISBN-13:	978-3-03-089715-4
Categories:	Books > Computing & IT > General theory of computing > General Books > Computing & IT > Computer programming > Software engineering Books > Computing & IT > Computer communications & networking > General Books > Computing & IT > Applications of computing > Artificial intelligence > General Promotions
LSN:	3-03-089715-X
Barcode:	9783030897154

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!