Reachability Problems

11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings

Nonfiction, Computers, Advanced Computing, Theory, General Computing, Programming
Cover of the book Reachability Problems by , Springer International Publishing
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: ISBN: 9783319670898
Publisher: Springer International Publishing Publication: August 28, 2017
Imprint: Springer Language: English
Author:
ISBN: 9783319670898
Publisher: Springer International Publishing
Publication: August 28, 2017
Imprint: Springer
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Springer International Publishing

Cover of the book Independent Television Production in the UK by
Cover of the book Local Welfare Policy Making in European Cities by
Cover of the book Search for New Phenomena in Dijet Angular Distributions at √s = 8 and 13 TeV by
Cover of the book Dynamics in Logistics by
Cover of the book Advances in Audio Watermarking Based on Singular Value Decomposition by
Cover of the book Psychology of Bilingualism by
Cover of the book International Handbook on Adolescent Health and Development by
Cover of the book Modeling, Computing and Data Handling Methodologies for Maritime Transportation by
Cover of the book Media, Diaspora and the Somali Conflict by
Cover of the book Contemporary Irish Writing and Environmentalism by
Cover of the book Colonial Justice and Decolonization in the High Court of Tanzania, 1920-1971 by
Cover of the book Coordination of Complex Sociotechnical Systems by
Cover of the book Plasticity-Damage Couplings: From Single Crystal to Polycrystalline Materials by
Cover of the book Archaeological Heritage in a Modern Urban Landscape by
Cover of the book Complications of Cirrhosis by
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy